Non-committing encryption from -hiding

DOI10.1007/978-3-662-46494-6_24zbMATH Open1359.94605OpenAlexW2163927648MaRDI QIDQ5261645FDOQ5261645

Authors: Brett Hemenway, Rafail Ostrovsky, Alon Rosen 

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_24

Recommendations

• Adaptive security with quasi-optimal rate
• Improved non-committing encryption with applications to adaptively secure protocols
• Adaptive and composable non-committing encryptions
• scientific article; zbMATH DE number 1759794
• Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (13)

• Improved non-committing encryption with applications to adaptively secure protocols
• Removing erasures with explainable hash proof systems
• Title not available (Why is that?)
• Adaptive security with quasi-optimal rate
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Receiver Selective Opening Security from Indistinguishability Obfuscation
• Adaptive and composable non-committing encryptions
• Adaptively secure MPC with sublinear communication complexity
• Non-committing encryptions based on oblivious Naor-Pinkas cryptosystems
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• New and improved constructions for partially equivocable public key encryption
• Selective opening security from simulatable data encapsulation
• Efficient one-sided adaptively secure computation

This page was built for publication: Non-committing encryption from \(\Phi\)-hiding

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