Efficient non-malleable commitment schemes

DOI10.1007/s00145-009-9045-2zbMath1210.94088MaRDI QIDQ5902225

Marc Fischlin, Roger Fischlin

Publication date: 13 November 2009

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hebis:30-12631

zbMATH Keywords

commitment; Chinese remainder theorem; proof of knowledge; non-malleability; common reference string; trapdoor commitment

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Constant-Round Nonmalleable Commitments from Any One-Way Function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Resettable zero-knowledge (extended abstract)
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Universally composable two-party and multi-party secure computation
• New notions of security
• Non-interactive and reusable non-malleable commitment schemes
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Pseudorandom Generator from any One-way Function
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Automata, Languages and Programming
• Finding smooth integers in short intervals using CRT decoding
• Selecting cryptographic key sizes