163 search results - page 4 / 33 » Computationally Convincing Proofs of Knowledge |
COCO
1991
Springer
13 years 11 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
USS
2010
13 years 5 months ago
2010
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
CRYPTO
2008
Springer
13 years 9 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...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
WECWIS
2005
IEEE
14 years 1 months ago
2005
IEEE
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...