Sciweavers

28 search results - page 3 / 6
» Zero-Knowledge Sets
Sort
View
IACR
2011
147views more  IACR 2011»
12 years 5 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
ASIACRYPT
2011
Springer
12 years 6 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
CRYPTO
2005
Springer
72views Cryptology» more  CRYPTO 2005»
13 years 11 months ago
Unconditional Characterizations of Non-interactive Zero-Knowledge
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...
Rafael Pass, Abhi Shelat
ESWS
2011
Springer
12 years 9 months ago
Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution
Abstract. Link traversal based query execution is a new query execution paradigm for the Web of Data. This approach allows the execution engine to discover potentially relevant dat...
Olaf Hartig
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
13 years 10 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky