Non-interactive and reusable non-malleable commitment schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New notions of security: achieving universal composability without trusted setup
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The random oracle methodology, revisited
Journal of the ACM (JACM)
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 basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
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
Adaptive One-Way Functions and Applications
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
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
Foundations of Non-malleable Hash and One-Way Functions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient and non-malleable proofs of plaintext knowledge and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Round efficiency of multi-party computation with a dishonest majority
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Efficient two party and multi party computation against covert adversaries
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Concurrent non-malleable commitments from any one-way function
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A multi-trapdoor commitment scheme from the RSA assumption
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Expedient non-malleability notions for hash functions
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
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
Completely non-malleable schemes
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Relaxing environmental security: monitored functionalities and client-server computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
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
Tight bounds for unconditional authentication protocols in the manual channel and shared key models
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Concurrently secure computation in constant rounds
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent non-malleable witness indistinguishable argument from any one-way function
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Hi-index | 0.00 |
We present the first constant-round non-malleable commitment scheme and the first constant-round non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor. Previous constructions either used a non-constant number of rounds, or were onlysecure under stronger setup assumptions. An example of such an assumption is the shared random string model where we assume all parties have access to a reference string that was chosen uniformly at random by a trusted dealer.We obtain these results by defining an adequate notion of non-malleable coin-tossing, and presenting a constant-round protocol that satisfies it. This protocol allows us to transform protocols that are non-malleable in (a modified notion of) the shared random string model into protocols that are non-malleable in the plain model (without any trusted dealer or setup assumptions). Observing that known constructions of a non-interactive non-malleable zero-knowledge argument systems in the shared random string model (De Santis et. al., 2001) are in fact non-malleable in the modified model, and combining them with our coin-tossing protocol we obtain the results mentioned above.The techniques we use are different from those used in previous constructions of non-malleable protocols. In particular our protocol uses diagonalization and a non-black-box proof of security (in a sense similar to Barak's zero-knowledge argument).