Black-box circular-secure encryption beyond affine functions

DOI10.1007/978-3-642-19571-6_13MaRDI QIDQ3000540zbMATH OpenOpenAlexFDO

Authors Zvika Brakerski, Yael Tauman Kalai, Shafi Goldwasser

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19571-6_13

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bounded key-dependent message security
• Key-dependent message security: generic amplification and completeness
• Key-dependent message security: generic amplification and completeness
• Efficient circuit-size independent public key encryption with KDM security
• Circular security is complete for KDM security

Cited in

(28)

• Bounded key-dependent message security
• Reproducible circularly-secure bit encryption: applications and realizations
• Completeness of single-bit projection-KDM security for public key encryption
• Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
• Naor-Yung Paradigm with Shared Randomness and Applications
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Reproducible circularly secure bit encryption: applications and realizations
• Naor-Yung paradigm with shared randomness and applications
• Master-key KDM-secure IBE from pairings
• Key-dependent message security for division function: discouraging anonymous credential sharing
• Universal amplification of KDM security: from 1-key circular to multi-key KDM
• The KDM-CCA Security of REACT
• Key-dependent message security: generic amplification and completeness
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
• SoK: learning with errors, circular security, and fully homomorphic encryption
• Garbled circuits as randomized encodings of functions: a primer
• Cryptographic primitives with hinting property
• Updatable public key encryption in the standard model
• Key-dependent message security: generic amplification and completeness
• Cryptographic primitives with hinting property
• KDM security for identity-based encryption: constructions and separations
• Efficient KDM-CCA secure public-key encryption for polynomial functions
• Circular security is complete for KDM security
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Bounded KDM security from iO and OWF

This page was built for publication: Black-box circular-secure encryption beyond affine functions

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