2-round zero knowledge and proof auditors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Concurrent zero-knowledge with timing, revisited
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Responsive Round Complexity and Concurrent Zero-Knowledge
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Journal of the ACM (JACM)
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The random oracle methodology, revisited
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Concurrent Non-Malleable Commitments
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the Impossibility of Obfuscation with Auxiliary Input
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
On the composition of authenticated Byzantine Agreement
Journal of the ACM (JACM)
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Compression from Collisions, or Why CRHF Combiners Have a Long Output
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Limits of Constructive Security Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identification Scheme with Tight Reduction
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the (Im)Possibility of Key Dependent Encryption
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Black-Box Constructions of Two-Party Protocols from One-Way Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
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
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
Local Sequentiality Does Not Help for Concurrent Composition
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Co-sound Zero-Knowledge with Public Keys
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
TCC'07 Proceedings of the 4th conference on Theory of cryptography
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Resettable zero-knowledge in the weak public-key model
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simulatable commitments and efficient concurrent zero-knowledge
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications 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
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
An improved semantically-secure identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
Obtaining universally compoable security: towards the bare bones of trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Isolated proofs of knowledge and isolated zero knowledge
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Separation results on the "one-more" computational problems
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Which languages have 4-round zero-knowledge proofs?
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Semi-honest to malicious oblivious transfer: the black-box way
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The round-complexity of black-box zero-knowledge: a combinatorial characterization
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Concurrent non-malleable commitments from any one-way function
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the round complexity of covert computation
Proceedings of the forty-second ACM symposium on Theory of computing
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the round complexity of zero-knowledge proofs based on one-way permutations
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Towards non-black-box lower bounds in cryptography
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Constant round non-malleable protocols using one way functions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing
On constant-round concurrent non-malleable proof systems
Information Processing Letters
Short locally testable codes and proofs
Studies in complexity and cryptography
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
Non-black-box techniques in cryptography
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On round-efficient argument systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Single-prover concurrent zero knowledge in almost constant rounds
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient signcryption without random oracles
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
You can prove so many things in zero-knowledge
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Composition of zero-knowledge proofs with efficient provers
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Private coins versus public coins in zero-knowledge proof systems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Relaxing environmental security: monitored functionalities and client-server computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Handling expected polynomial-time strategies in simulation-based security proofs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Sufficient conditions for collision-resistant hashing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Impossibility and feasibility results for zero knowledge with public keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Secure computation without authentication
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On robust combiners for oblivious transfer and other primitives
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
On the impossibility of three-move blind signature schemes
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Constant-Round non-malleable commitments from sub-exponential one-way functions
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Resettable cryptography in constant rounds --- the case of zero knowledge
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Separating short structure-preserving signatures from non-interactive assumptions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A note on (im)possibilities of obfuscating programs of zero-knowledge proofs of knowledge
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Point obfuscation and 3-round zero-knowledge
TCC'12 Proceedings of the 9th 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
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Black-box reductions and separations in cryptography
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Concurrent non-malleable witness indistinguishable argument from any one-way function
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
A note on constant-round concurrent zero-knowledge arguments of knowledge for NP
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
On constant-round precise zero-knowledge
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
A unified framework for UC from only OT
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Concurrent zero knowledge in the bounded player model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Public-Coin concurrent zero-knowledge in the global hash model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the (in)security of fischlin’s paradigm
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
A cookbook for black-box separations and a recipe for UOWHFs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Randomness-Dependent message security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Non-black-box simulation in the fully concurrent setting
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the impossibility of approximate obfuscation and applications to resettable cryptography
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
OAKE: a new family of implicitly authenticated diffie-hellman protocols
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Constant-round adaptive zero-knowledge proofs for NP
Information Sciences: an International Journal
| Hi-index | 0.00 |
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary's algorithm as a black-box. We present the first constructions of nonblack-box simulators. Using these new non-black-box techniques we obtain several results that were previously proven to be impossible to obtain using black-box simulators.Specifically, assuming the existence of collision resistent hash functions, we construct a new zeroknowledge argument system for NP that satisfies the following properties:1. This system has a constant number of rounds with negligible soundness error.2. It remains zero knowledge even when composed concurrently n times, where n is the security parameter. Simultaneously obtaining 1 and 2 has been recently proven to be impossible to achieve using black-box simulators.3. It is an Arthur-Merlin (public coins) protocol. Simultaneously obtaining 1 and 3 was known to be impossible to achieve with a black-box simulator.4. It has a simulator that runs in strict polynomial time, rather than in expected polynomial time.All previously known constant-round, negligible error zero-knowledge arguments utilized expected polynomial-time simulators.