Filters








91 Hits in 3.2 sec

Breaking an Identity-Based Encryption Scheme Based on DHIES [chapter]

Martin R. Albrecht, Kenneth G. Paterson
2011 Lecture Notes in Computer Science  
On the Security of the Identity-based Encryption based on DHIES from ASIACCS 2010 (short paper).  ...  We conclude that the scheme does not offer an attractive trade-off between security and efficiency. Y. Chen, M. Charlemagne, Z. Guan, J. Hu and Z. Chen. Identity-based encryption based on DHIES.  ... 
doi:10.1007/978-3-642-25516-8_21 fatcat:mmcbaqqjxvh3xakfi53np6veme

On the security of the identity-based encryption based on DHIES from ASIACCS 2010

Willy Susilo, Joonsang Baek
2011 Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11  
In ASIACCS 2010, Chen, Charlemagne, Guan, Hu and Chen proposed an interesting construction of identity-based encryption based on DHIES, whose key extraction algorithm makes use of the multivariate quadratic  ...  s scheme is insecure in the sense of IND-sID-CCA by showing that the private key extraction algorithm of their scheme can be exploited to apply XL algorithm, which is to solve the multivariate quadratic  ...  CONCLUSION In ASIACCS 2010, Chen, Charlemagne, Guan, Hu and Chen [9] proposed an interesting identity-based encryption scheme based on DHIES.  ... 
doi:10.1145/1966913.1966962 dblp:conf/ccs/SusiloB11 fatcat:u5i4iqs4dzghdnesynr4gjnqxa

Security Proof of Sakai-Kasahara's Identity-Based Encryption Scheme [chapter]

Liqun Chen, Zhaohui Cheng
2005 Lecture Notes in Computer Science  
Identity-based encryption (IBE) is a special asymmetric encryption method where a public encryption key can be an arbitrary identifier and the corresponding private decryption key is created by binding  ...  We then prove that SK-IBE has chosen ciphertext security in the random oracle model based on a reasonably well-explored hardness assumption. Encrypt.  ...  us the latest work on the security notions of IBE [19] , Alex Dent for his detailed and valuable comments on the manuscript, and anonymous referees for useful feedback.  ... 
doi:10.1007/11586821_29 fatcat:apabs2xgdngo7cq4coi5hpoica

A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE [chapter]

Jin Li, Fangguo Zhang, Yanming Wang
2006 Lecture Notes in Computer Science  
A new hierarchical identity based (ID-based) cryptosystem is proposed, including hierarchical identity based encryption (HIBE) and signature (HIBS) schemes.  ...  The new HIBE scheme can be proved to be secure without relying on the random oracle model. Then, a new public key encryption (PKE) scheme is constructed based on the new HIBE.  ...  The Most important contribution of this paper is that an efficient PKE scheme is constructed based on the new HIBE.  ... 
doi:10.1007/11807964_37 fatcat:kqcv4kjtyrbord5hds2x6aq3vq

Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles [chapter]

Dan Boneh, Xavier Boyen
2004 Lecture Notes in Computer Science  
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model in groups equipped with a bilinear map.  ...  The first system is based on the decisional bilinear Diffie-Hellman assumption, and extends to give a selective identity Hierarchical IBE secure without random oracles.  ...  Acknowledgments The comment on threshold systems in Section 6 came out of a discussion with Shai Halevi. We also thank Shai Halevi and Jonathan Katz for helpful comments on this work.  ... 
doi:10.1007/978-3-540-24676-3_14 fatcat:cossqhfs5nhjvpeju2k643zen4

Privacy-Aware Authentication in the Internet of Things [chapter]

Hannes Gross, Marko Hölbl, Daniel Slamanig, Raphael Spreitzer
2015 Lecture Notes in Computer Science  
In this work, we build upon the idea of an RFID-based IoT realized by means of standardized and well-established Internet protocols.  ...  With this work, we show that privacy in the IoT can be achieved without relying on proprietary protocols and on the basis of existing Internet standards.  ...  Figure 9 shows our IPsec-conform privacy-aware mutual authentication protocol, which relies on the Diffie-Hellman Integrated Encryption (DHIES) scheme [3] .  ... 
doi:10.1007/978-3-319-26823-1_3 fatcat:cf4vblpxqfe5fnsxu26cws3rha

One-Pass HMQV and Asymmetric Key-Wrapping [chapter]

Shai Halevi, Hugo Krawczyk
2011 Lecture Notes in Computer Science  
The leading mechanisms in this respect is the "elliptic-curve integrated encryption scheme" (ECIES) [12], which is based on the "Diffie-Hellman integrated encryption scheme" (DHIES) encryption scheme of  ...  DHIES is an Elgamal-based encryption scheme, proven CCA secure under the "hashed Diffie-Hellman" assumption. (Alternatively, under the Gap Diffie-Hellman assumption in the random-oracle model.)  ...  Instead, one would like a solution that (a) ensures that the identity of Bob cannot be stripped from the key, and (b) remains as close as possible to the base DHIES scheme.  ... 
doi:10.1007/978-3-642-19379-8_20 fatcat:ysd6chk44fhajolaof6x3alrwe

Deleting Secret Data with Public Verifiability

Feng Hao, Dylan Clarke, Avelino Francisco Zorzo
2016 IEEE Transactions on Dependable and Secure Computing  
Existing software-based data erasure programs can be summarized as following the same one-bit-return protocol: the deletion program performs data erasure and returns either success or failure.  ...  To our knowledge, this is the first systematic solution to the secure data deletion problem based on a "trust-but-verify" paradigm, together with a concrete prototype implementation.  ...  For the encryption, we adopt the Diffie-Hellman Integrated Encryption Scheme (DHIES) [1] . First, the TPM generates an ephemeral public key Q η = d η · G where d η ∈ R [1, n − 1] .  ... 
doi:10.1109/tdsc.2015.2423684 fatcat:sifrnrmpuzfa3go22epbieqcnu

Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection [chapter]

Stanisław Jarecki, Xiaomin Liu
2009 Lecture Notes in Computer Science  
In other words, an OPRF protocol for PRF f k (·) is a secure computation for functionality We propose an OPRF protocol on committed inputs which requires only O(1) modular exponentiations, and has a constant  ...  Inversion assumption on a group of composite order, where q is the size of the PRF domain, and it has a useful feature that f k is an injection for every k.  ...  If Z distinguishes Game 3 and Game 4 , then Red breaks the semantic security of the encryption scheme.  ... 
doi:10.1007/978-3-642-00457-5_34 fatcat:5rlsijvb3rgfzj4oav5we6s7tq

Public key encryption without random oracle made truly practical

Puwen Wei, Xiaoyun Wang, Yuliang Zheng
2012 Computers & electrical engineering  
An important research area in the past decade is to search for efficient cryptographic schemes that do not rely for their security on the controversial random oracle assumption.  ...  Specifically, we show how to modify a universal hash based public key encryption scheme proposed by Zheng and Seberry at Crypto'92, in such a way that the resultant scheme not only preserves efficiency  ...  While for the encryption schemes based on discrete logarithm, DHIES [1] is one of the most efficient schemes without random oracle.  ... 
doi:10.1016/j.compeleceng.2012.02.001 fatcat:qty7vgz2enfyrkjtqgck7dy4ke

Public Key Encryption without Random Oracle Made Truly Practical [chapter]

Puwen Wei, Xiaoyun Wang, Yuliang Zheng
2009 Lecture Notes in Computer Science  
An important research area in the past decade is to search for efficient cryptographic schemes that do not rely for their security on the controversial random oracle assumption.  ...  Specifically, we show how to modify a universal hash based public key encryption scheme proposed by Zheng and Seberry at Crypto'92, in such a way that the resultant scheme not only preserves efficiency  ...  While for the encryption schemes based on discrete logarithm, DHIES [1] is one of the most efficient schemes without random oracle.  ... 
doi:10.1007/978-3-642-11145-7_10 fatcat:idiu42ricbey7ezl23vxkw6lty

Identity Based Encryption Without Redundancy [chapter]

Benoît Libert, Jean-Jacques Quisquater
2005 Lecture Notes in Computer Science  
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval.  ...  This shows that in public key encryption schemes, redundancies may be useless even when the encryption mapping is not a surjection.  ...  More precisely, this notion would be an identity based flavored extension of the One-Wayness against Plaintext-Checking Attacks characterizing schemes that remain computationally one-way even in the presence  ... 
doi:10.1007/11496137_20 fatcat:gd4ngo5n5fg3hmaz62yepkqrau

Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security

Mihir Bellare, Alexandra Boldyreva, Kaoru Kurosawa, Jessica Staddon
2007 IEEE Transactions on Information Theory  
We consider popular CBC encryption with random IV, based on a given block cipher. The IV is the randomness underlying the encryption.  ...  If the message is one block long then the CBC-based RR-MRES allows to reduce the length of the broadcast ciphertext by 50%. HYBRID ENCRYPTION.  ...  DHIES We consider the other DDH-based encryption scheme DHIES [ABR] which is in several draft standards.  ... 
doi:10.1109/tit.2007.907471 fatcat:7gislzq7lnhqxdr3q55o4khjrm

A Closer Look at Anonymity and Robustness in Encryption Schemes [chapter]

Payman Mohassel
2010 Lecture Notes in Computer Science  
Roughly speaking, an anonymous encryption scheme hides the identity of the secret-key holder, while a robust encryption scheme guarantees that every ciphertext can only be decrypted to a valid plaintext  ...  We primarily use collision-freeness as an intermediate notion by showing a more efficient construction for transforming any collision-free encryption scheme into a strongly robust one.  ...  In this paper we study several aspects of anonymity and robustness in public-key and identity-based encryption schemes.  ... 
doi:10.1007/978-3-642-17373-8_29 fatcat:uvpowrrlijbe3in226faydq6ku

Balancing Security and Efficiency for Smart Metering against Misbehaving Collectors

Jianbing Ni, Kuan Zhang, Xiaodong Lin, Xuemin Shen
2017 IEEE Transactions on Smart Grid  
In addition, we design a dynamic billing mechanism based on individual power consumption maintained on collectors with the verification of customers.  ...  Data encryption can protect the readings, but lengthens the data size.  ...  We compare the P 2 SM with three schemes, EPPA [8] (based on Paillier encryption [18] ), Fan14 [16] (based on BGN encryption [19] ) and Ohara14 [17] (based on Lifted ElGamal encryption [21] ).  ... 
doi:10.1109/tsg.2017.2761804 fatcat:n7bwzrqlubaj7jhou5hsuscayu
« Previous Showing results 1 — 15 out of 91 results