89 search results - page 16 / 18 » On Interactive Proofs with a Laconic Prover |
152
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
138
click to vote
KBSE
1998
IEEE
15 years 10 months ago
1998
IEEE
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
134
click to vote
COCO
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
199
click to vote
JOC
2006
15 years 6 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
161
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...