Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
From MaRDI portal
Publication:2821797
DOI10.1137/110847196zbMath1406.94033OpenAlexW2521451511MaRDI QIDQ2821797
Huijia Lin, Ran Canetti, Rafael Pass
Publication date: 23 September 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110847196
Related Items (23)
One-message zero knowledge and non-malleable commitments ⋮ On the security loss of unique signatures ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ COA-secure obfuscation and applications ⋮ Non-malleable commitments against quantum attacks ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Concurrently composable non-interactive secure computation ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ What security can we achieve within 4 rounds? ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ On the CCA compatibility of public-key infrastructure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Probabilistic encryption
- Minimum disclosure proofs of knowledge
- Security and composition of multiparty cryptographic protocols
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Concurrently Secure Computation in Constant Rounds
- Black-Box Constructions of Composable Protocols without Set-Up
- Resettable zero-knowledge (extended abstract)
- Universally composable two-party and multi-party secure computation
- New notions of security
- Universally Composable Security with Global Setup
- Adaptive One-Way Functions and Applications
- Founding Cryptography on Oblivious Transfer – Efficiently
- The Knowledge Complexity of Interactive Proof Systems
- 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
- Foundations of Cryptography
- A Unified Framework for UC from Only OT
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- A unified framework for concurrent security
- Non-malleability amplification
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Concurrent zero-knowledge
- On Constant-Round Concurrent Zero-Knowledge
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
