Constant-Round Nonmalleable Commitments from Any One-Way Function

DOI10.1145/2699446zbMath1321.94079OpenAlexW1978654594MaRDI QIDQ5501951

Huijia Lin, Rafael Pass

Publication date: 14 August 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2699446

zbMATH Keywords

cryptographyconstant-roundnonmalleability

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Game theoretic notions of fairness in multi-party coin toss ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Probabilistic encryption
• Minimum disclosure proofs of knowledge
• How to construct constant-round zero-knowledge proof systems for NP
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Non-interactive and reusable non-malleable commitment schemes
• New and improved constructions of non-malleable cryptographic protocols
• Concurrent Non-Malleable Zero Knowledge Proofs
• Adaptive One-Way Functions and Applications
• The Knowledge Complexity of Interactive Proof Systems
• Coin flipping by telephone a protocol for solving impossible problems
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Nonmalleable Cryptography
• A unified framework for concurrent security
• Non-malleability amplification
• Constant round non-malleable protocols using one way functions
• Constant-round non-malleable commitments from any one-way function
• Concurrent Non-malleable Commitments from Any One-Way Function
• Efficient non-malleable commitment schemes
• Universal service-providers for private information retrieval

This page was built for publication: Constant-Round Nonmalleable Commitments from Any One-Way Function