Constant-round non-malleable commitments from any one-way function

Authors:
Huijia Lin;Rafael Pass
Affiliations:
Cornell, Ithaca, NY, USA;Cornell, Ithaca, NY, USA
Venue:
Proceedings of the forty-third annual ACM symposium on Theory of computing
Year:
2011

Citing 30
Cited 4

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Achieving independence in logarithmic number of rounds

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Nonmalleable Cryptography

SIAM Journal on Computing
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Non-interactive and reusable non-malleable commitment schemes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Bounded-concurrent secure multi-party computation with a dishonest majority

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Coin flipping by telephone a protocol for solving impossible problems

ACM SIGACT News - A special issue on cryptography
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
One-way functions are essential for complexity based cryptography

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Adaptive One-Way Functions and Applications

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A unified framework for concurrent security: universal composability from stand-alone non-malleability

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
Efficient Non-malleable Commitment Schemes

Journal of Cryptology
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
Concurrent non-malleable commitments from any one-way function

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Concurrent non-malleable zero knowledge proofs

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
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 sub-exponential one-way functions

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Concurrent non-malleable statistically hiding commitment

Information Processing Letters
Concurrently secure computation in constant rounds

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show unconditionally that the existence of commitment schemes implies the existence of constant-round non-malleable commitments; earlier protocols required additional assumptions such as collision resistant hash functions or subexponential one-way functions. Our protocol also satisfies the stronger notions of concurrent non-malleability and robustness. As a corollary, we establish that constant-round non-malleable zero-knowledge arguments for NP can be based on one-way functions and constant-round secure multi-party computation can be based on enhanced trapdoor permutations; also here, earlier protocols additionally required either collision-resistant hash functions or subexponential one-way functions.