Sciweavers

10 search results - page 2 / 2
» Composition of Zero-Knowledge Proofs with Efficient Provers
Sort
View
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
ECCC
2000
120views more  ECCC 2000»
13 years 5 months ago
A Complete Problem for Statistical Zero Knowledge
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
Amit Sahai, Salil P. Vadhan
SIGSOFT
2003
ACM
14 years 6 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
13 years 9 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval