搜索结果: 1-7 共查到“军事学 Subexponential”相关记录7条 . 查询时间(0.062 秒)
We construct a 2-message publicly verifiable witness indistinguishable argument system for NP assuming that the Learning with Errors (LWE) problem is subexponentially hard. Moreover, the protocol is `...
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
indistinguishability obfuscation extremely lossy functions subexponential assumptions
2018/5/23
We consider the problem of removing subexponential assumptions from cryptographic constructions based on indistinguishability obfuscation (iO). Specifically, we show how to apply complexity absorption...
A Subexponential Construction of Graph Coloring for Multiparty Computation
cryptographic protocols Multiparty Computations
2016/1/26
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal...
Equations System coming from Weil descent and subexponential attack for algebraic curve cryptosystem
ECDLP first fall degree
2014/3/10
Faug\'ere et al. shows that the decomposition problem of a point of elliptic curve over binary field $F_{2^n}$ reduces to solving low degree equations system over $F_2$ coming from Weil descent. Using...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...