Black-box circular-secure encryption beyond affine functions

DOI10.1007/978-3-642-19571-6_13zbMATH Open1295.94028OpenAlexW1515692266MaRDI QIDQ3000540FDOQ3000540

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (28)

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

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)