Adaptive hardness and composable security in the plain model from standard assumptions

DOI10.1137/110847196zbMATH Open1406.94033OpenAlexW2521451511MaRDI QIDQ2821797FDOQ2821797

Authors: Ran Canetti, Huijia Lin, 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

Recommendations

• Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
• Feasibility and infeasibility of adaptively secure fully homomorphic encryption
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Adaptive and composable non-committing encryptions
• A simpler variant of universally composable security for standard multiparty computation
• Composition Implies Adaptive Security in Minicrypt
• Advances in Cryptology – CRYPTO 2004
• Universally composable security with local adversaries

zbMATH Keywords

cryptographysecure multiparty computationcomposable securityadaptive hardness

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

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
• Security and composition of multiparty cryptographic protocols
• Resettable zero-knowledge (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Cryptography
• Nonmalleable Cryptography
• Foundations of Cryptography
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Founding Cryptography on Oblivious Transfer – Efficiently
• Title not available (Why is that?)
• The Knowledge Complexity of Interactive Proof Systems
• Title not available (Why is that?)
• Concurrent zero-knowledge
• Adaptive One-Way Functions and Applications
• Non-malleability amplification
• Concurrent Non-malleable Commitments from Any One-Way Function
• Title not available (Why is that?)
• Universally composable two-party and multi-party secure computation
• New notions of security: achieving universal composability without trusted setup
• Universally Composable Security with Global Setup
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified framework for concurrent security
• Theory of Cryptography
• Title not available (Why is that?)
• On Constant-Round Concurrent Zero-Knowledge
• Theory of Cryptography
• 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
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• A unified framework for UC from only OT
• Constant-round black-box construction of composable multi-party computation protocol

Cited In (30)

• On non-uniform security for black-box non-interactive CCA commitments
• Can PPAD hardness be based on standard cryptographic assumptions?
• What security can we achieve within 4 rounds?
• Composable long-term security with rewinding
• 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
• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Theory of Cryptography
• Maliciously-secure MrNISC in the plain model
• Can PPAD hardness be based on standard cryptographic assumptions?
• Composition Implies Adaptive Security in Minicrypt
• Concurrently composable non-interactive secure computation
• Constant round adaptively secure protocols in the tamper-proof hardware model
• COA-secure obfuscation and applications
• Non-malleable commitments against quantum attacks
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• On the CCA compatibility of public-key infrastructure
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• On non-black-box simulation and the impossibility of approximate obfuscation
• Concurrently composable security with shielded super-polynomial simulators
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• A new approach to efficient non-malleable zero-knowledge
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Overcoming impossibility results in composable security using interval-wise guarantees
• On the exact round complexity of self-composable two-party computation
• Round-efficient black-box construction of composable multi-party computation

This page was built for publication: Adaptive hardness and composable security in the plain model from standard assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821797)