Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311548
DOI10.1007/B99099zbMATH Open1104.94028DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311548FDOQ5311548
Authors: Kaoru Kurosawa, Yvo Desmedt
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
Recommendations
- A new hybrid encryption scheme
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Design of a new security protocol using hybrid cryptography algorithms
- New cryptosystems design based on hybrid-mode problems
- A hybrid encryption algorithm based on multi-crypto system
- Hybrid encryption in a multi-user setting, revisited
- scientific article; zbMATH DE number 4070802
- Secure Hybrid Encryption from Weakened Key Encapsulation
Cited In (95)
- Non-malleable encryption: simpler, shorter, stronger
- Signcryption schemes with insider security in an ideal permutation model
- Efficient hybrid encryption from ID-based encryption
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Cryptography and Coding
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
- Efficient selective identity-based encryption without random oracles
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
- The Twin Diffie-Hellman Problem and Applications
- Some (in)sufficient conditions for secure hybrid encryption
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Efficient KDM-CCA secure public-key encryption for polynomial functions
- Non-malleable encryption: simpler, shorter, stronger
- The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure
- Unbounded HIBE with tight security
- Tightly secure signatures and public-key encryption
- Parameter-hiding order revealing encryption
- Title not available (Why is that?)
- Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- The ECCA Security of Hybrid Encryptions
- Regular lossy functions and their applications in leakage-resilient cryptography
- Robust encryption, revisited
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- Leaky Random Oracle (Extended Abstract)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system
- Hybrid encryption in a multi-user setting, revisited
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Constructing secure hybrid encryption from key encapsulation mechanism with authenticity
- Related-key security for hybrid encryption
- Cryptography and Coding
- Adaptive partitioning
- An efficient post-quantum KEM from CSIDH
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Secure hybrid encryption in the standard model from hard learning problems
- Authenticated Key Exchange and Key Encapsulation in the Standard Model
- CCA-security from adaptive all-but-one lossy trapdoor functions
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption
- Secure integration of asymmetric and symmetric encryption schemes
- Security models and proof strategies for plaintext-aware encryption
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism
- Practical chosen ciphertext secure encryption from factoring
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Practical Identity-Based Encryption Without Random Oracles
- Password-authenticated group key establishment from smooth projective hash functions
- A note on a provable secure encryption scheme
- Efficient KEMs with Partial Message Recovery
- Subvert KEM to break DEM: practical algorithm-substitution attacks on public-key encryption
- New approaches for deniable authentication
- Tag-KEM/DEM: A new framework for hybrid encryption
- Improved efficiency of Kiltz07-KEM
- A new framework for deniable secure key exchange
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- Security Against Related Randomness Attacks via Reconstructive Extractors
- Multi-recipient Public-Key Encryption from Simulators in Security Proofs
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Security on Hybrid Encryption with the Tag-KEM/DEM Framework
- Improved tradeoff between encapsulation and decapsulation of HK09
- Multi-instance secure public-key encryption
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Efficient CCA-secure CDH based KEM balanced between ciphertext and key
- RCCA security for KEM+DEM style hybrid encryptions
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Lossy key encapsulation mechanism and its applications
- Grey-box public-key steganography
- Generic Constructions of Stateful Public Key Encryption and Their Applications
- A CCA Secure Hybrid Damgård’s ElGamal Encryption
- Sender-anamorphic encryption reformulated: achieving robust and generic constructions
- Identification schemes from key encapsulation mechanisms
- A Brief History of Provably-Secure Public-Key Encryption
- Efficient certificateless KEM in the standard model
- Hybrid Damgård Is CCA1-Secure under the DDH Assumption
- Sender-binding key encapsulation
- Constructing Strong KEM from Weak KEM (or How to Revive the KEM/DEM Framework)
- Toothpicks: more efficient fork-free two-round multi-signatures
- Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
- Key encapsulation mechanisms from extractable hash proof systems, revisited
- Offline Assisted Group Key Exchange
- Relations between constrained and bounded chosen ciphertext security for key encapsulation mechanisms
- On the impossibility of purely algebraic signatures
- A new hybrid encryption scheme
- Plaintext-awareness of hybrid encryption
- Theory of Cryptography
- In search of mathematical primitives for deriving universal projective hash families
This page was built for publication: Advances in Cryptology – CRYPTO 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311548)