scientific article; zbMATH DE number 1759794
From MaRDI portal
Publication:4536817
zbMath0989.68509MaRDI QIDQ4536817
Jesper Buus Nielsen, Ivan B. Damgård
Publication date: 6 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Leakage-resilient cryptography from minimal assumptions ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Triply adaptive UC NIZK ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting ⋮ Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Possibility and impossibility results for selective decommitments ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Cryptography and cryptographic protocols ⋮ Efficient one-sided adaptively secure computation ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Adaptive Security with Quasi-Optimal Rate ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Cryptography in the multi-string model ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ On the power of secure two-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ On selective-opening security of deterministic primitives ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Ring signatures: Stronger definitions, and constructions without random oracles ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
This page was built for publication:
