Non-committing Encryption from Φ-hiding
From MaRDI portal
Publication:5261645
DOI10.1007/978-3-662-46494-6_24zbMath1359.94605OpenAlexW2163927648MaRDI QIDQ5261645
Rafail Ostrovsky, Brett Hemenway, 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
Related Items (9)
Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Selective Opening Security from Simulatable Data Encapsulation ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Efficient one-sided adaptively secure computation ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Adaptive Security with Quasi-Optimal Rate ⋮ Adaptively secure MPC with sublinear communication complexity
This page was built for publication: Non-committing Encryption from Φ-hiding