Optimal asymmetric encryption
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Semantic security for the McEliece cryptosystem without random oracles
- Efficient public key encryption with smallest ciphertext expansion from factoring
- Upgrading to functional encryption
- Random oracles and non-uniformity
- The wonderful world of global random oracles
- Secret, verifiable auctions from elections
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
- Practical chosen ciphertext secure encryption from factoring
- Secure integration of asymmetric and symmetric encryption schemes
- Signcryption schemes with insider security in an ideal permutation model
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Everybody's a target: scalability in public-key encryption
- Classical vs quantum random oracles
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- Publicly verifiable zero knowledge from (collapsing) blockchains
- SimS: a simplification of SiGamal
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- CryptHOL: game-based proofs in higher-order logic
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- Fast, compact, and expressive attribute-based encryption
- The TLS handshake protocol: A modular analysis
- Signcryption from randomness recoverable public key encryption
- New rank codes based encryption scheme using partial circulant matrices
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Security models and proof strategies for plaintext-aware encryption
- Second order collision for the 42-step reduced DHA-256 hash function
- Asymmetric cryptographic algorithms
- Some observations on the theory of cryptographic hash functions
- Optimal key systems
- Multi-use and unidirectional identity-based proxy re-encryption schemes
- Constructing parallel long-message signcryption scheme from trapdoor permutation
- Post-quantum verification of Fujisaki-Okamoto
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
- On CCA-Secure Somewhat Homomorphic Encryption
- Secret sets and applications
- On the security of distributed multiprime RSA
- Signcryption Schemes Based on the RSA Problem
- Concealment and its applications to authenticated encryption
- Parallel signcryption
- Applications of signcryption
- scientific article; zbMATH DE number 2085419 (Why is no real title available?)
- scientific article; zbMATH DE number 5846081 (Why is no real title available?)
- Beyond provable security verifiable IND-CCA security of OAEP
- Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
- Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
- Practical cryptanalysis of ISO 9796-2 and EMV signatures
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Bug attacks
- A practical approach to attaining chosen ciphertext security
- Further analysis of block ciphers against timing attacks
- Robust and efficient sharing of RSA functions
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Program synthesis using dual interpretation
- A Brief History of Provably-Secure Public-Key Encryption
- Relationship between Two Approaches for Defining the Standard Model PA-ness
- McEliece Cryptosystem Implementation: Theory and Practice
- Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
- Bug Attacks
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
- OAEP Is Secure under Key-Dependent Messages
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Strengthening Security of RSA-OAEP
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Salvaging Merkle-Damgård for Practical Applications
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
- Possibility and impossibility results for selective decommitments
- Two extensions of the ring signature scheme of Rivest-Shamir-Taumann
- All-or-nothing encryption and the package transform
- Sliding encryption: a cryptographic tool for mobile agents
- Cryptographic transformations of non-Shannon sources of information
- Cryptography using \texttt{CAPTCHA} puzzles
- Secure integration of asymmetric and symmetric encryption schemes
- Provably secure Rabin-p cryptosystem in hybrid setting
- Fast, compact, and expressive attribute-based encryption
- Toward RSA-OAEP without random oracles
- A Note on the Instantiability of the Quantum Random Oracle
- The KDM-CCA Security of REACT
- Post-quantum Security of Plain OAEP Transform
- Delegation of cryptographic servers for capture-resilient devices
- On the construction of a semantically secure modification of the McEliece cryptosystem
- Automated proofs for asymmetric encryption
- Using LLL-reduction for solving RSA and factorization problems
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Randomized coding of plaintext encryption scheme
- Automated proofs for asymmetric encryption
- Relations Among Notions of Plaintext Awareness
- Completely Non-malleable Encryption Revisited
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Multi-property Preserving Combiners for Hash Functions
- Efficient KEMs with Partial Message Recovery
- Leaky Random Oracle (Extended Abstract)
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Optimal asymmetric encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365732)
