Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)

DOI10.1007/978-3-319-10879-7_5zbMath1423.68155OpenAlexW22852778MaRDI QIDQ2922654

Claudio Orlandi, Antonio Marcedone

Publication date: 14 October 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-10879-7_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (10)

Counterexamples to new circular security assumptions underlying iO ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Threshold ECDSA with an offline recovery party ⋮ 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 ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption

This page was built for publication: Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)