Constant-Round Nonmalleable Commitments from Any One-Way Function
From MaRDI portal
Publication:5501951
DOI10.1145/2699446zbMATH Open1321.94079OpenAlexW1978654594MaRDI QIDQ5501951FDOQ5501951
Authors: 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
Recommendations
- Constant-round non-malleable commitments from any one-way function
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant round non-malleable protocols using one way functions
- Four-round concurrent non-malleable commitments from one-way functions
- Non-malleable statistically hiding commitment from any one-way function
- Constant-round asynchronous multi-party computation based on one-way functions
- One-message zero knowledge and non-malleable commitments
- Non-interactive and reusable non-malleable commitment schemes
- scientific article; zbMATH DE number 1722670
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Probabilistic encryption
- 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
- Bit commitment using pseudorandomness
- Minimum disclosure proofs of knowledge
- How to construct constant-round zero-knowledge proof systems for NP
- Title not available (Why is that?)
- Foundations of Cryptography
- Nonmalleable Cryptography
- Constant-round non-malleable commitments from any one-way function
- The Knowledge Complexity of Interactive Proof Systems
- Constant-round non-malleable commitments from sub-exponential one-way functions
- New and improved constructions of non-malleable cryptographic protocols
- Adaptive One-Way Functions and Applications
- Non-malleability amplification
- Constant round non-malleable protocols using one way functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- Title not available (Why is that?)
- Concurrent non-malleable zero knowledge proofs
- Title not available (Why is that?)
- A unified framework for concurrent security
- Coin flipping by telephone a protocol for solving impossible problems
- Universal service-providers for private information retrieval
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Title not available (Why is that?)
- Non-interactive and reusable non-malleable commitment schemes
- Efficient non-malleable commitment schemes
Cited In (16)
- Another step towards realizing random oracles: non-malleable point obfuscation
- Constant-round non-malleable commitments from any one-way function
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Game-theoretically secure protocols for the ordinal random assignment problem
- Game theoretic notions of fairness in multi-party coin toss
- One-message zero knowledge and non-malleable commitments
- Four-round concurrent non-malleable commitments from one-way functions
- Concurrent non-malleable commitments (and more) in 3 rounds
- Non-malleable statistically hiding commitment from any one-way function
- Constant round non-malleable protocols using one way functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent Non-Malleable Witness Indistinguishable Argument from Any One-Way Function
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Four-round black-box non-malleable schemes from one-way permutations
- Constant-round non-malleable commitments from sub-exponential one-way functions
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
This page was built for publication: Constant-Round Nonmalleable Commitments from Any One-Way Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501951)
