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

(31)

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

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)