Concurrent Non-Malleable Commitments

Authors:
Rafael Pass;Alon Rosen
Affiliations:
MIT;Harvard
Venue:
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Year:
2005

Citing 28
Cited 21

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Witness indistinguishable and witness hiding protocols

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 note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Computationally Sound Proofs

SIAM Journal on Computing
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
Efficient Non-malleable Commitment Schemes

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Session-Key Generation Using Human Passwords Only

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: 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
Bounded-concurrent secure two-party computation without setup assumptions

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
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
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
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 and improved constructions of non-malleable cryptographic protocols

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Secure computation without authentication

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Universally composable password-based key exchange

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption

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
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
Co-sound Zero-Knowledge with Public Keys

AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
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
Completely non-malleable encryption revisited

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Deniable internet key exchange

ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Expedient non-malleability notions for hash functions

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
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
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
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
Public-Coin concurrent zero-knowledge in the global hash model

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
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
Byzantine renaming in synchronous systems with t

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Non-black-box simulation in the fully concurrent setting

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin- the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver, cannot make the values he commits to depend on the values he receives commitments to. Our result is achieved without assuming an a-priori bound on the number of executions and without relying on any set-up assumptions. Our construction relies on the existence of standard collision resistant hash functions and only requires a constant number of communication rounds.