A Protocol to Achieve Independence in Constant Rounds
IEEE Transactions on Parallel and Distributed Systems
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
One-Round Secure Computation and Secure Autonomous Mobile Agents
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
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
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
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
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Improved Security Notions and Protocols for Non-transferable Identification
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
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
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Universally Composable Adaptive Priced Oblivious Transfer
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Non-malleable Statistically Hiding Commitment from Any One-Way Function
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Zero Knowledge in the Random Oracle Model, Revisited
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Long-term security and universal composability
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Lower bounds for non-interactive zero-knowledge
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
A simpler construction of CCA2-secure public-key encryption under general assumptions
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
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
Simulatable VRFs with applications to multi-theorem NIZK
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
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
A brief history of provably-secure public-key encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Certificateless encryption schemes strongly secure in the standard model
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Efficient chosen-ciphertext security via extractable hash proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On server trust in private proxy auctions
Electronic Commerce Research
Limits on the power of zero-knowledge proofs in cryptographic constructions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Cryptography in constant parallel time
Cryptography in constant parallel time
Simulation-sound NIZK proofs for a practical language and constant size group signatures
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
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
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Linkable democratic group signatures
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Conditional digital signatures
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
On non-interactive zero-knowledge proofs of knowledge in the shared random string model
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Proof of plaintext knowledge for the ajtai-dwork cryptosystem
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A digital cash protocol based on additive zero knowledge
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Impossibility and feasibility results for zero knowledge with public keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Reducing complexity assumptions for statistically-hiding commitment
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Mercurial commitments with applications to zero-knowledge sets
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Constant-Round concurrent non-malleable statistically binding commitments and decommitments
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Round-optimal composable blind signatures in the common reference string model
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Non-interactive zaps and new techniques for NIZK
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Ring signatures: stronger definitions, and constructions without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Malleable proof systems and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Concurrent non-malleable witness indistinguishable argument from any one-way function
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Succinct malleable NIZKs and an application to compact shuffles
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Our constructions can be used in cryptographic applications in which the prover is restricted to polynomial time.