Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
From MaRDI portal
Publication:3650698
DOI10.1007/978-3-642-10366-7_17zbMath1267.94053OpenAlexW2122774732MaRDI QIDQ3650698
Seung Geol Choi, Hoeteck Wee, Dana Dachman-Soled, Tal Malkin
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_17
Related Items (18)
Two-round adaptively secure multiparty computation from standard assumptions ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ 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 ⋮ Efficient one-sided adaptively secure computation ⋮ Model-based testing of probabilistic systems ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Adaptive Security with Quasi-Optimal Rate ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Fully deniable interactive encryption
This page was built for publication: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
