1,798 Hits in 4.0 sec

Chosen-Ciphertext Security for Any One-Way Cryptosystem [chapter]

David Pointcheval
2000 Lecture Notes in Computer Science  
As application, we provide the most efficient El Gamal encryption variant, therefore secure relative to the computational Diffie-Hellman problem.  ...  This paper presents a generic technique to make a highly secure cryptosystem from any partially trapdoor one-way function, in the random oracle model.  ...  Some Partially Trapdoor One-Way Injective Functions The Diffie-Hellman Problem.  ... 
doi:10.1007/978-3-540-46588-1_10 fatcat:qdwiss7kevaaxltdldbrerxv5u

A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications [chapter]

Emmanuel Bresson, Dario Catalano, David Pointcheval
2003 Lecture Notes in Computer Science  
The scheme is computationally binding under the assumption that factoring is hard, thus improving on the previous construction by Catalano et al. [5] whose binding property was based on the assumption  ...  RSA with the public exponent set to N ) is hard.  ...  The Decisional Diffie-Hellman Assumption is related to the regular Diffie-Hellman assumption that says that given g a and g b one cannot compute g ab in polynomial time.  ... 
doi:10.1007/978-3-540-40061-5_3 fatcat:6ndel4nmqfan7jwf46rgmjjeem

Extended-DDH and Lossy Trapdoor Functions [chapter]

Brett Hemenway, Rafail Ostrovsky
2012 Lecture Notes in Computer Science  
Lossy trapdoor functions were used to build the first injective trapdoor functions based on DDH, the first IND-CCA cryptosystems based on lattice assumptions, and they are known to imply deterministic  ...  More specifically, we define an Extended Decisional Diffie Hellman (EDDH) assumption, which is a simple and natural generalization of DDH.  ...  Hash Proof Systems Peikert and Waters [PW08] gave a construction of lossy trapdoor functions from the Decisional Diffie-Hellman (DDH) assumption.  ... 
doi:10.1007/978-3-642-30057-8_37 fatcat:ylvx7jvxuze7pbjrjo2lqrkhnm

Provable Security

Xiaofeng Chen
2011 Journal of Internet Services and Information Security  
key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) model.  ...  It is shown that the protocol is secure in the enhanced Canetti-Krawczyk (eCK) model under the gap Diffie-Hellman (GDH) assumption.  ... 
doi:10.22667/jisis.2011.08.31.001 dblp:journals/jisis/Chen11 fatcat:cp77gihlmne25b7qut53cxvzku

Public Key Encryption with Keyword Search in Cloud: A Survey

Yunhong Zhou, Na Li, Yanmei Tian, Dezhi An, Licheng Wang
2020 Entropy  
With the popularization of cloud computing, many business and individuals prefer to outsource their data to cloud in encrypted form to protect data confidentiality.  ...  From a technological viewpoint, the existing PEKS schemes can be classified into several variants: PEKS based on public key infrastructure, PEKS based on identity-based encryption, PEKS based on attribute-based  ...  CDH refers to Computational Diffie-Hellman assumption.  ... 
doi:10.3390/e22040421 pmid:33286195 pmcid:PMC7516898 fatcat:qovvzpdonnbd5bswb7j7q5igiq

Chameleon Hashing Without Key Exposure [chapter]

Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
2004 Lecture Notes in Computer Science  
We can prove that the recipient's trapdoor information will never be compromised under the assumption of Computation Diffie-Hellman Problem (CDHP) is intractable.  ...  Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest.  ...  A chameleon hash function is a trapdoor one-way hash function, which prevents everyone except the holder of the trapdoor information from computing the collisions for a randomly given input.  ... 
doi:10.1007/978-3-540-30144-8_8 fatcat:rnnobyisxrexdjzttjyxofullq

Efficient Chosen-Ciphertext Security via Extractable Hash Proofs [chapter]

Hoeteck Wee
2010 Lecture Notes in Computer Science  
Computational Diffie-Hellman (CDH) problem.  ...  Diffie-Hellman (DDH) assumption or the quadratic residuosity assumption.  ...  I thank the anonymous Crypto 2010 reviewers for pointing out that our framework applies to the constructions in [7, 27, 28] , for suggesting the name "adaptive trapdoor relations", and for many helpful  ... 
doi:10.1007/978-3-642-14623-7_17 fatcat:gy2trq7ypbb6ddz4ywaole7zya

Generalized Digital Certificate for User Authentication and Key Establishment for Secure Communications

Lein Harn, Jian Ren
2011 IEEE Transactions on Wireless Communications  
Instead, the owner proves to the verifier that he has the knowledge of the signature by responding to the verifier's challenge.  ...  The digital signature of the GDC is used as a secret token of each user that will never be revealed to any verifier.  ...  The user sends and back to . 4) After receiving the and from the user , the verifier uses his secret to compute the Diffie-Hellman shared secret key 3) The user first uses his secret to compute the  ... 
doi:10.1109/twc.2011.042211.101913 fatcat:snjn3pk42rdkjdkh2nubujxfa4

Discrete logarithm based chameleon hashing and signatures without key exposure

Xiaofeng Chen, Fangguo Zhang, Haibo Tian, Baodian Wei, Kwangjo Kim
2011 Computers & electrical engineering  
In this paper, we propose the first key-exposure free chameleon hash and signature scheme based on discrete logarithm systems, without using the gap Diffie-Hellman groups.  ...  Recently, some constructions of discrete logarithm based chameleon hashing and signatures without key exposure are presented, while in the setting of gap Diffie-Hellman groups with pairings.  ...  Acknowledgement The authors are grateful to the anonymous referees for their invaluable suggestions for improving this paper.  ... 
doi:10.1016/j.compeleceng.2011.03.011 fatcat:mkrows5bmvd2nkxxh5tqfagwpm

Efficient Design of Certificateless Chameleon Signature from Bilinear Pairing

Tejeshwari Thakur, Neetu Sharma, Birendra Kumar Sharma
2014 International Journal of Database Theory and Application  
The proposed scheme is more efficient than schemes. And our scheme is un-forgeable under the hardness assumption of the q-strong Diffie-Hellman problem and Computational Diffie-Hellman problem.  ...  It does rely upon the use of a trusted third party (TTP), who is in possession of a master key. CL-PKC does not suffer from the key escrow property.  ...  Acknowledgements The first author 1 is thankful to UGC, New Delhi, India for providing Rajiv Gandhi National Fellowship (F1-17.1/2010-13/RGNF-2012-13-ST-CHH-35416) as financial assistance for this Research  ... 
doi:10.14257/ijdta.2014.7.3.03 fatcat:7t46planqzhthog4xrelitdu5q

Fast generators for the Diffie–Hellman key agreement protocol and malicious standards

Boaz Tsaban
2006 Information Processing Letters  
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation.  ...  On the other hand, we show that if there is some case in which fast generators are less secure, then this could be used by a malicious authority to generate a standard for the Diffie-Hellman key agreement  ...  Galbraith has pointed out to us that there exist bit security results which show that for various natural functions F , computing F (g ab ) from g a and g b is as hard as the Diffie-Hellman Problem.  ... 
doi:10.1016/j.ipl.2005.11.025 fatcat:p35atwh3bfhf3hvzyrx3j37tle

Identity-Based Chameleon Hash Scheme without Key Exposure [chapter]

Xiaofeng Chen, Fangguo Zhang, Willy Susilo, Haibo Tian, Jin Li, Kwangjo Kim
2010 Lecture Notes in Computer Science  
In this paper, we propose the first identity-based chameleon hash scheme without key exposure, which gives a positive answer for the open problem introduced by Ateniese and de Medeiros in 2004.  ...  A chameleon hash function is a trapdoor one-way hash function, which prevents everyone except the holder of the trapdoor information from computing the collisions for a randomly given input.  ...  -Computation Diffie-Hellman Problem (CDHP): Given P, aP, bP for a, b ∈ Z * q , to compute abP.  ... 
doi:10.1007/978-3-642-14081-5_13 fatcat:f6eqyu5d6rhqlgllxfzyr6qm4a

Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation [chapter]

Susan Hohenberger, Amit Sahai, Brent Waters
2014 Lecture Notes in Computer Science  
The term full domain hash was first proposed by Bellare and Rogaway [BR93, BR96] and referred to a signature scheme from any trapdoor permutation that was part of their seminal work introducing the random  ...  Hash Susan Signatures to be based on trapdoor permutations, and its extension by Dodis, Haitner, and Tentes [DHT12] to the RSA Full-Domain Hash Signatures.  ...  We thank Dan Boneh for many helpful discussions and also for pointing out the equivalence of our assumption used for adaptive BLS case to the Diffie-Hellman  ... 
doi:10.1007/978-3-642-55220-5_12 fatcat:avfahcynwrh73b3cf5t766koey

An Efficient Searchable Public-Key Authenticated Encryption for Cloud-Assisted Medical Internet of Things

Tianyu Chi, Baodong Qin, Dong Zheng
2020 Wireless Communications and Mobile Computing  
We prove that our scheme is semantically secure against inside keyword guessing attacks in a multiuser setting, under the oracle Diffie-Hellman assumption.  ...  The shared key will be used to encrypt keywords by the sender and to generate search trapdoors by the receiver.  ...  Acknowledgments This work is supported by the National Natural Science  ... 
doi:10.1155/2020/8816172 fatcat:bnrghoqymfd2ll3ew3fkjtjeiy

Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures [chapter]

Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
2004 Lecture Notes in Computer Science  
Universal Designated-Verifier Signature (UDVS) schemes are digital signature schemes with additional functionality which allows any holder of a signature to designate the signature to any desired designatedverifier  ...  such that the designated-verifier can verify that the message was signed by the signer, but is unable to convince anyone else of this fact.  ...  However, for the DV-Unforgeability of SchUDVS 1 , it is clear that the stronger 'Computational Diffie-Hellman' (CDH) assumption in G is certainly necessaryan attacker can forge a DV signature (u, K) on  ... 
doi:10.1007/978-3-540-24632-9_7 fatcat:nx3gemqhszc5rj5pz2vqmff544
« Previous Showing results 1 — 15 out of 1,798 results