11 search results - page 1 / 3 » Noninteractive Statistical Zero-Knowledge Proofs for Lattice... |
113
Voted
CRYPTO
2008
Springer
15 years 2 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
113
Voted
TCC
2010
Springer
15 years 10 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...
102
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
ASIACRYPT
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
117
Voted
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...