On selective-opening security of deterministic primitives

DOI10.1007/978-3-030-75248-4_6MaRDI QIDQ2061952zbMATH OpenOpenAlexFDO

Authors Adam O'Neill, Mohammad Zaheri

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-75248-4_6

zbMATH Keywords

deterministic public-key encryptioninformation theoretic settingone-more RSArandomness extractorselective opening security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Standard security does not imply security against selective-opening
• On selective-opening attacks against encryption schemes
• How secure is deterministic encryption?
• Standard security does not imply indistinguishability under selective opening
• Selective Opening Security for Receivers

Cites work

• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Adaptive One-Way Functions and Applications
• Advances in Cryptology - EUROCRYPT 2004
• Bi-deniable public-key encryption
• Correlated-input secure hash functions
• How secure is deterministic encryption?
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1942434 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• scientific article; zbMATH DE number 2086712 (Why is no real title available?)
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Limits of provable security from standard assumptions
• Lossy trapdoor functions and their applications
• Lower and upper bounds for deniable public-key encryption
• Magic functions
• On definitions of selective opening security
• Optimal security proofs for full domain hash, revisited
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Selective-Opening Security in the Presence of Randomness Failures
• Standard Security Does Imply Security Against Selective Opening for Markov Distributions
• Standard security does not imply indistinguishability under selective opening
• Standard security does not imply security against selective-opening
• Standard versus selective opening security: separation and equivalence results
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Theory of Cryptography

Cited in

(3)

• Standard Security Does Imply Security Against Selective Opening for Markov Distributions
• Receiver Selective Opening Security from Indistinguishability Obfuscation
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

This page was built for publication: On selective-opening security of deterministic primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061952)