The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
SIAM Journal on Computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
SIAM Journal on Computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Concurrent Zero Knowledge with Logarithmic Round-Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Zero Knowledge Proofs of Knowledge in Two Rounds
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Universal Arguments and their Applications
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
How to Go Beyond the Black-Box Simulation Barrier
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the concurrent composition of zero-knowledge proofs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Simulation in quasi-polynomial time, and its application to protocol composition
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Proceedings of the forty-first annual ACM symposium on Theory of computing
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Precise concurrent zero knowledge
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
On constant-round concurrent zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Password-authenticated session-key generation on the internet in the plain model
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Leakage-resilient zero knowledge
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Precise time and space simulatable zero-knowledge
ProvSec'11 Proceedings of the 5th international conference on Provable security
Eye for an eye: efficient concurrent zero-knowledge in the timing model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The knowledge tightness of parallel zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Resource-based corruptions and the combinatorics of hidden diversity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On constant-round precise zero-knowledge
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
| Hi-index | 0.00 |
We put forward the notion of Local Zero Knowledge and provide its first implementations in a variety of settings under standard complexity assumptions.Whereas the classical notion of Zero Knowledge guarantees the secrecy only of information that is hard to compute, the new one meaningfully guarantees the secrecy of any information (in case of perfect zero-knowledge, and asymptotically in all other cases). Consequently, Local Zero Knowledge remains very meaningful even if DP = NP.