Reproducible circularly-secure bit encryption: applications and realizations

DOI10.1007/978-3-662-47989-6_11MaRDI QIDQ3457112zbMATH OpenOpenAlexFDO

Authors Mohammad Hajiabadi, Bruce M. Kapron

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

(non-)shielding CCA constructioncircular securitycorrelated-input securitydeterministic encryptiontrapdoor functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Reproducible circularly secure bit encryption: applications and realizations
• On the circular security of bit-encryption
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Lossy trapdoor functions from homomorphic reproducible encryption
• On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes

Cites work

• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
• Black-box circular-secure encryption beyond affine functions
• Bounded key-dependent message security
• Chosen-ciphertext security via correlated products
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Deterministic and Efficiently Searchable Encryption
• Dual projective hashing and its applications -- lossy trapdoor functions and more
• Efficient circuit-size independent public key encryption with KDM security
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Key-dependent message security: generic amplification and completeness
• Lossy trapdoor functions from homomorphic reproducible encryption
• More constructions of lossy and correlation-secure trapdoor functions
• On the circular security of bit-encryption
• Randomness is linear in space
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Randomness-dependent message security
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Two is a crowd? A black-box separation of one-wayness and security under correlated inputs

Cited in

(16)

• Reproducible circularly secure bit encryption: applications and realizations
• CPA-to-CCA transformation for KDM security
• Circular security is complete for KDM security
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Cryptographic agility and its relation to circular encryption
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• Lossy trapdoor functions from homomorphic reproducible encryption
• On the circular security of bit-encryption
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• CCA security and trapdoor functions via key-dependent-message security
• Cryptographic primitives with hinting property
• Universal amplification of KDM security: from 1-key circular to multi-key KDM
• Cryptographic primitives with hinting property
• Chosen ciphertext security via BARGs

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

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