Efficient and Non-interactive Non-malleable Commitment (original) (raw)
Related papers
Non-interactive and non-malleable commitment
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Constructing Non-malleable Commitments: A Black-Box Approach
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
2000
Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
Corr, 2006
BRICS Report Series, 2001
Efficient Two-Party Secure Computation on Committed Inputs
Lecture Notes in Computer Science, 2007
Committing Encryption and Publicly-Verifiable SignCryption
IACR Cryptol. ePrint Arch., 2003
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Lecture Notes in Computer Science
Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives
J. Internet Serv. Inf. Secur., 2016
Gradual and Verifiable Release of a Secret (Extended Abstract)
Advances in Cryptology — CRYPTO ’87, 1988
Concurrent Non-Malleable Zero Knowledge
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006
On The Efficiency of Bit Commitment Reductions
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
Lecture Notes in Computer Science, 2009
Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm
Provable Security, 2010
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Lecture Notes in Computer Science, 2004
Non-committing Encryption with Constant Ciphertext Expansion from Standard Assumptions
Advances in Cryptology – ASIACRYPT 2020, 2020
Practical and provably secure release of a secret and exchange of signatures
Journal of Cryptology, 1995
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security
Advances in Cryptology – ASIACRYPT 2020, 2020
Computational Soundness of Non-Malleable Commitments
2008
Concurrent Non-malleable Commitments from Any One-Way Function
Muthuramakrishnan Venkitasubramaniam
Lecture Notes in Computer Science, 2008
Mercurial Commitments with Applications to Zero-Knowledge Sets
2005
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
Lecture Notes in Computer Science, 2011
Provably Secure Convertible Undeniable Signatures with Unambiguity
Lecture Notes in Computer Science, 2010
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
2010
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC)
2009
Efficient Public-Key Cryptography in the Presence of Key Leakage
2010
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
2017
Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
Lecture Notes in Computer Science, 2013
Reducing Complexity Assumptions for Statistically-Hiding Commitment
2009
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
Lecture Notes in Computer Science, 2014
Efficient committed oblivious transfer of bit strings
Berry Schoenmakers, Mehmet Sabir Kiraz
Information Security, 2007
Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
2006 IEEE International Symposium on Information Theory, 2006
Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions
Lecture Notes in Computer Science, 2010