Reproducible circularly secure bit encryption: applications and realizations

DOI10.1007/S00145-016-9246-4zbMath1386.94072OpenAlexW2557658137WikidataQ122222374 ScholiaQ122222374MaRDI QIDQ1698399

Bruce M. Kapron, Mohammad Hajiabadi

Publication date: 15 February 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-016-9246-4

zbMATH Keywords

trapdoor functionsdeterministic encryption(non-)shielding CCA constructioncircular securitycorrelated-input security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Lossy trapdoor functions from homomorphic reproducible encryption
• Key-dependent message security: generic amplification and completeness
• Better security for deterministic public-key encryption: the auxiliary-input setting
• Theory of cryptography. 7th theory of cryptography conference, TCC 2010, Zurich, Switzerland, February 9--11, 2010. Proceedings
• Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
• Randomness is linear in space
• More constructions of lossy and correlation-secure trapdoor functions
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Building Lossy Trapdoor Functions from Lossy Encryption
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Efficient Circuit-Size Independent Public Key Encryption with KDM Security
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Lossy Trapdoor Functions and Their Applications
• Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
• Public-Key Encryption Schemes with Auxiliary Inputs
• Bounded Key-Dependent Message Security
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Circular-Secure Encryption from Decision Diffie-Hellman
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Deterministic and Efficiently Searchable Encryption
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Randomness Re-use in Multi-recipient Encryption Schemeas
• On the Circular Security of Bit-Encryption
• Randomness-Dependent Message Security
• Circular Chosen-Ciphertext Security with Compact Ciphertexts
• Bit Encryption Is Complete
• Chosen-Ciphertext Security via Correlated Products
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Public-Key Cryptosystems Resilient to Key Leakage
• Theory of Cryptography

This page was built for publication: Reproducible circularly secure bit encryption: applications and realizations