On selective-opening security of deterministic primitives
From MaRDI portal
Recommendations
Cites work
- A threshold pseudorandom function construction and its applications
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Adaptive One-Way Functions and Applications
- Adaptively-secure, non-interactive public-key encryption
- Advances in Cryptology - EUROCRYPT 2004
- Bi-deniable public-key encryption
- Correlated-input secure hash functions
- Deniable encryption
- 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?)
- Improved non-committing encryption schemes based on a general complexity assumption
- 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
- Optimal security proofs for PSS and other signature schemes
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Selective-Opening Security in the Presence of Randomness Failures
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
- 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
- Towards realizing random oracles: hash functions that hide all partial information
Cited in
(3)
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)