Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Standard versus Selective Opening Security: Separation and Equivalence Results

Dennis Hofheinz, Andy Rupp

Published Jan 1, 2014• 37 citations
Publisher
DOI
10.1007/978-3-642-54242-8_25

Related papers

Separating Selective Opening Security from Standard Security, Assuming Indistinguishability Obfuscation

Justin Holmgren, Brent R. Waters

Lecture notes in computer science•Jan 1, 2026•0 citations

Standard Security Does Not Imply Security against Selective-Opening

Mihir Bellare Y, Rafael Dowsley, Brent R. Waters +1 more

Lecture notes in computer science•Jan 1, 2012•82 citations

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

Mihir Bellare Y, Dennis Hofheinz, Scott Yilek

Lecture notes in computer science•Jan 1, 2009•271 citations

Simulatability versus Indistinguishability SOA: CCA Relations are Sampler-Dependent

Hans Heum

Contrary to expectation, we show that there is no general reduction from simulation-based selective opening security (SSO) to indistinguishability-based selective opening security (ISO) in the CCA setting. In particular, we show that when restricted to certain message distributions, SSO-CCA is incomparable with ISO-CCA. This contrasts the CPA case, where SSO-CPA is known to be strictly stronger than ISO-CPA relative to any message sampler. Any sampler with high enough min-entropy suffices for this “semi-separation” to appear. On the other hand, we show that restricting to distributions with very low min-entropy gives rise to an implication. Our main result does not rely on the presence of selective openings, but rather follow from subtleties in the game structures. At a glance, this may seem to contradict known equivalences between indistinguishability, semantic security, and selective opening security under trivial openings. We reconcile the apparent contradiction by showing that the CCA landscape splits into a “high-entropy” and a “low-entropy” world, which for notions of SOA must be treated separately.

IACR Communications in Cryptology•Jan 8, 2026•0 citations

On Definitions of Selective Opening Security

Florian Böhl, Dennis Hofheinz, Daniel Kraschewski

Lecture notes in computer science•Jan 1, 2012•63 citations

Selective-Opening Security in the Presence of Randomness Failures

Viet Tung Hoang, Jonathan I. Katz, Adam O’Neill +1 more

Lecture notes in computer science•Jan 1, 2016•16 citations
Contrary to expectation, we show that there is no general reduction from simulation-based selective opening security (SSO) to indistinguishability-based selective opening security (ISO) in the CCA setting. In particular, we show that when restricted to certain message distributions, SSO-CCA is incomparable with ISO-CCA. This contrasts the CPA case, where SSO-CPA is known to be strictly stronger than ISO-CPA relative to any message sampler. Any sampler with high enough min-entropy suffices for this “semi-separation” to appear. On the other hand, we show that restricting to distributions with very low min-entropy gives rise to an implication. Our main result does not rely on the presence of selective openings, but rather follow from subtleties in the game structures. At a glance, this may seem to contradict known equivalences between indistinguishability, semantic security, and selective opening security under trivial openings. We reconcile the apparent contradiction by showing that the CCA landscape splits into a “high-entropy” and a “low-entropy” world, which for notions of SOA must be treated separately.