Adaptive hardness and composable security in the plain model from standard assumptions
From MaRDI portal
Publication:2821797
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
Cites work
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A unified framework for UC from only OT
- A unified framework for concurrent security
- Adaptive One-Way Functions and Applications
- Bit commitment using pseudorandomness
- Black-box constructions of composable protocols without set-up
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Concurrent zero-knowledge
- Concurrently secure computation in constant rounds
- Constant-round black-box construction of composable multi-party computation protocol
- Foundations of Cryptography
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Minimum disclosure proofs of knowledge
- New notions of security: achieving universal composability without trusted setup
- Non-malleability amplification
- Nonmalleable Cryptography
- On Constant-Round Concurrent Zero-Knowledge
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Resettable zero-knowledge (extended abstract)
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Round-efficient black-box construction of composable multi-party computation
- Security and composition of multiparty cryptographic protocols
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
Cited in
(30)- Overcoming impossibility results in composable security using interval-wise guarantees
- On the CCA compatibility of public-key infrastructure
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- 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
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- A new approach to efficient non-malleable zero-knowledge
- Black-box non-interactive non-malleable commitments
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Can PPAD hardness be based on standard cryptographic assumptions?
- On the exact round complexity of self-composable two-party computation
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Maliciously-secure MrNISC in the plain model
- Round-efficient black-box construction of composable multi-party computation
- Concurrently composable non-interactive secure computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- On non-black-box simulation and the impossibility of approximate obfuscation
- On non-uniform security for black-box non-interactive CCA commitments
- Theory of Cryptography
- Composition Implies Adaptive Security in Minicrypt
- Concurrently composable security with shielded super-polynomial simulators
- Can PPAD hardness be based on standard cryptographic assumptions?
- What security can we achieve within 4 rounds?
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- COA-secure obfuscation and applications
- Non-malleable commitments against quantum attacks
- Composable long-term security with rewinding
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)
