A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
On the Necessity of Strong Assumptions for the Security of a Class of Asymmetric Encryption Schemes
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
GEM: A Generic Chosen-Ciphertext Secure Encryption Method
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Secure hybrid encryption from weakened key encapsulation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
About the security of ciphers (semantic security and pseudo-random permutations)
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Modular security proofs for key agreement protocols
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Identity based encryption without redundancy
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Simple password-based encrypted key exchange protocols
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Compact CCA-Secure Encryption for Messages of Arbitrary Length
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Practical Chosen Ciphertext Secure Encryption from Factoring
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A New Variant of the Cramer-Shoup KEM Secure against Chosen Ciphertext Attack
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Multi-recipient Public-Key Encryption from Simulators in Security Proofs
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Improved efficiency of Kiltz07-KEM
Information Processing Letters
Strongly Secure Certificateless Key Agreement
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Proceedings of the 16th ACM conference on Computer and communications security
Strongly Secure Authenticated Key Exchange without NAXOS' Approach
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman Protocols
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Efficient Constructions of Signcryption Schemes and Signcryption Composability
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Twin hybrid ElGamal encryption over signed quadratic residue groups
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
A generic method for reducing ciphertext length of reproducible KEMs in the RO model
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
ProvSec'10 Proceedings of the 4th international conference on Provable security
Chosen-ciphertext secure identity-based encryption from computational bilinear Diffie-Hellman
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
On shortening ciphertexts: new constructions for compact public key and stateful encryption schemes
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Chosen ciphertext secure encryption under factoring assumption revisited
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Parallel decryption queries in bounded chosen ciphertext attacks
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Compact identity-based encryption without strong symmetric cipher
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Strongly secure identity-based authenticated key agreement protocols
Computers and Electrical Engineering
Identity-based key exchange protocols without pairings
Transactions on computational science X
Generic methods to achieve tighter security reductions for a category of IBE schemes
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Identification schemes from key encapsulation mechanisms
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
SEC'11 Proceedings of the 20th USENIX conference on Security
Efficient CCA-secure CDH based KEM balanced between ciphertext and key
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
New constructions of public-key encryption schemes from conjugacy search problems
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Acquiring key privacy from data privacy
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
The twin bilinear diffie-Hellman inversion problem and applications
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Toward compact public key encryption based on CDH assumption via extended twin DH assumption
ProvSec'11 Proceedings of the 5th international conference on Provable security
The n-Diffie-Hellman problem and its applications
ISC'11 Proceedings of the 14th international conference on Information security
Provably secure three-party password-based authenticated key exchange protocol
Information Sciences: an International Journal
Characterization of strongly secure authenticated key exchanges without NAXOS technique
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Simple and efficient public-key encryption from computational diffie-hellman in the standard model
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient CCA-Secure PKE from identity-based techniques
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A novel commutative blinding identity based encryption scheme
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Improved efficiency of chosen ciphertext secure encryption from factoring
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Detecting dangerous queries: a new approach for chosen ciphertext security
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Outsider-Anonymous broadcast encryption with sublinear ciphertexts
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Identity-based extractable hash proofs and their applications
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
CCA secure IB-KEM from the computational bilinear diffie-hellman assumption in the standard model
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Improved tradeoff between encapsulation and decapsulation of HK09
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Selective opening chosen ciphertext security directly from the DDH assumption
NSS'12 Proceedings of the 6th international conference on Network and System Security
A robust and plaintext-aware variant of signed elgamal encryption
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Proceedings of the first ACM workshop on Asia public-key cryptography
Toward practical group encryption
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
On secure data sharing in cloud environment
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Publicly verifiable ciphertexts
Journal of Computer Security - Advances in Security for Communication Networks
Hi-index | 0.00 |
We propose a new computational problem called the twin Diffie-Hellman problem. This problem is closely related to the usual (computational) Diffie-Hellman problem and can be used in many of the same cryptographic constructions that are based on the Diffie-Hellman problem. Moreover, the twin Diffie-Hellman problem is at least as hard as the ordinary Diffie-Hellman problem. However, we are able to show that the twin Diffie-Hellman problem remains hard, even in the presence of a decision oracle that recognizes solutions to the problem -- this is a feature not enjoyed by the ordinary Diffie-Hellman problem. In particular, we show how to build a certain "trapdoor test" which allows us to effectively answer such decision oracle queries, without knowing any of the corresponding discrete logarithms. Our new techniques have many applications. As one such application, we present a new variant of ElGamal encryption with very short ciphertexts, and with a very simple and tight security proof, in the random oracle model, under the assumption that the ordinary Diffie-Hellman problem is hard. We present several other applications as well, including: a new variant of Diffie and Hellman's non-interactive key exchange protocol; a new variant of Cramer-Shoup encryption, with a very simple proof in the standard model; a new variant of Boneh-Franklin identity-based encryption, with very short ciphertexts; a more robust version of a password-authenticated key exchange protocol of Abdalla and Pointcheval.