Improved non-committing encryption with applications to adaptively secure protocols

DOI10.1007/978-3-642-10366-7_17MaRDI QIDQ3650698zbMATH OpenOpenAlexFDO

Authors Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee

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

zbMATH Keywords

adaptive corruptionnon-committing encryptionpublic-key encryptionsecure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1759794
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Non-committing encryption from -hiding
• Adaptive and composable non-committing encryptions
• Adaptive security with quasi-optimal rate

Cited in

(34)

• Two-round adaptively secure multiparty computation from standard assumptions
• Fully deniable interactive encryption
• On black-box complexity of universally composable security in the CRS model
• 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
• Towards tight adaptive security of non-interactive key exchange
• Adaptive security with quasi-optimal rate
• Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
• Adaptive and composable non-committing encryptions
• A multi-trapdoor commitment scheme from the RSA assumption
• Receiver Selective Opening Security from Indistinguishability Obfuscation
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• New and improved constructions of non-malleable cryptographic protocols
• Composition Implies Adaptive Security in Minicrypt
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems
• scientific article; zbMATH DE number 2050890 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• Feasibility and infeasibility of adaptively secure fully homomorphic encryption
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Efficient one-sided adaptively secure computation
• Non-committing encryption from -hiding
• Removing erasures with explainable hash proof systems
• Adaptively secure MPC with sublinear communication complexity
• New and improved constructions for partially equivocable public key encryption
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Reverse firewalls for adaptively secure MPC without setup
• Deniable cryptosystems: simpler constructions and achieving leakage resilience
• Model-based testing of probabilistic systems
• Deny whatever you want: dual-deniable public-key encryption
• Non-committing identity based encryption: constructions and applications

This page was built for publication: Improved non-committing encryption with applications to adaptively secure protocols

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