93 search results - page 7 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
FUN
2007
Springer
14 years 1 months ago
2007
Springer
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer