Adaptive and composable non-committing encryptions

DOI10.1007/978-3-642-14081-5_9MaRDI QIDQ3163101zbMATH OpenOpenAlexFDO

Authors Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Publication date 25 October 2010

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14081-5_9

zbMATH Keywords

adaptive securitynon-committing encryptionsuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Improved non-committing encryption with applications to adaptively secure protocols
• scientific article; zbMATH DE number 1759794
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Non-committing encryption from -hiding
• Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems

Cited in

(13)

• Optimal-rate non-committing encryption
• Towards tight adaptive security of non-interactive key exchange
• Adaptive hardness and composable security in the plain model from standard assumptions
• Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
• Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Composition Implies Adaptive Security in Minicrypt
• Improved non-committing encryption with applications to adaptively secure protocols
• Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Non-committing encryption from -hiding
• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees

This page was built for publication: Adaptive and composable non-committing encryptions

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