Black-Box Circular-Secure Encryption beyond Affine Functions

DOI10.1007/978-3-642-19571-6_13zbMath1295.94028OpenAlexW1515692266MaRDI QIDQ3000540

Shafi Goldwasser, Zvika Brakerski, Yael Tauman Kalai

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)

Related Items (23)

Master-Key KDM-Secure IBE from Pairings ⋮ The KDM-CCA Security of REACT ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Cryptographic primitives with hinting property ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Key-dependent message security: generic amplification and completeness ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ 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 ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

This page was built for publication: Black-Box Circular-Secure Encryption beyond Affine Functions