Filters








42 Hits in 5.0 sec

Bilinear Entropy Expansion from the Decisional Linear Assumption [chapter]

Lucas Kowalczyk, Allison Bishop Lewko
2015 Lecture Notes in Computer Science  
We develop a technique inspired by pseudorandom functions that allows us to increase the entropy available for proving the security of dual system encryption schemes under the Decisional Linear Assumption  ...  The shares belonging to all attributes form a vector over Z p .  ...  assumption such as the decisional linear assumption (DLIN).  ... 
doi:10.1007/978-3-662-48000-7_26 fatcat:dijuxpucubb37gejlab6ah3wtu

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting [chapter]

Zvika Brakerski, Gil Segev
2011 Lecture Notes in Computer Science  
Within this framework, we propose two schemes: the first is based on the decisional Diffie-Hellman (and, more generally, on the d-linear) assumption, and the second is based on a rather general class of  ...  Bellare et al. addressed this difficulty by requiring semantic security to hold only when the plaintext has high min-entropy from the adversary's point of view.  ...  Our first construction is based on the decisional Diffie-Hellman assumption, (and more generally, on any of the d-linear assumptions), and our second construction is based on a rather general class of  ... 
doi:10.1007/978-3-642-22792-9_31 fatcat:2wqngpibvvajtnljikbjh3e5le

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting [chapter]

Allison Lewko
2012 Lecture Notes in Computer Science  
schemes that are proven secure from the decisional linear assumption.  ...  This provides a close analog of the Boneh-Boyen IBE scheme that is proven fully secure from the decisional linear assumption. We also provide a translation of the Lewko-Waters unbounded HIBE scheme.  ...  from the decisional linear assumption (DLIN) in prime order bilinear groups.  ... 
doi:10.1007/978-3-642-29011-4_20 fatcat:zeubdepyd5bf7alykjdwt7rqli

Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More [chapter]

Avradip Mandal, Arnab Roy
2015 Lecture Notes in Computer Science  
Using the linear Relational Hash schemes we develop Relational Hashes for detecting proximity in terms of hamming distance.  ...  We develop a Relational Hash scheme for discovering linear relations among bit-vectors (elements of F n 2 ) and Fp-vectors.  ...  Assumption 2 (Decisional Binary Mix).  ... 
doi:10.1007/978-3-662-47989-6_25 fatcat:anllsw5725aavnpsfujnwtp6cu

Relational Hash [chapter]

Avradip Mandal, Arnab Roy
2016 The Role and Importance of Mathematics in Innovation  
Using the linear Relational Hash schemes we develop Relational Hashes for detecting proximity in terms of hamming distance.  ...  We develop a Relational Hash scheme for discovering linear relations among bit-vectors (elements of F n 2 ) and Fp-vectors.  ...  Assumption 2 (Decisional Binary Mix).  ... 
doi:10.1007/978-981-10-0962-4_9 fatcat:q4k6dcte7zfnlgb43dczaftbue

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting

Zvika Brakerski, Gil Segev
2013 Journal of Cryptology  
Within this framework, we propose two schemes: the first is based on the d-linear assumption for any d ≥ 1 (including, in particular, the decisional Diffie-Hellman assumption), and the second is based  ...  Bellare et al. addressed this difficulty by requiring semantic security to hold only when the plaintext has high min-entropy from the adversary's point of view.  ...  Acknowledgements The second author would like to thank Ilya Mironov and Omkant Pandey for useful discussions on deterministic public-key encryption.  ... 
doi:10.1007/s00145-012-9143-4 fatcat:jaqammijjbdcrkswrdlkhvu6mm

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps [chapter]

Shuichi Katsumata, Shota Yamada
2016 Lecture Notes in Computer Science  
from the same assumption.  ...  This is the first IBE scheme based on the hardness of a computational/search problem, rather than a decisional problem such as DDH and DLIN on bilinear maps with sub-linear public parameter size.  ...  We also thank the members of Shin-Akarui-Angou-Benkyoukai for their helpful  ... 
doi:10.1007/978-3-662-53890-6_23 fatcat:zfz7ekwvk5gqjohc3occ3ce5jy

Correlated Pseudorandom Functions from Variable-Density LPN

Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
2020 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)  
The VDLPN assumption is independently motivated by two additional applications.  ...  Parity with Noise assumption (VDLPN).  ...  We would like to thank Nader Bshouty, Rocco Servedio, Jean-Pierre Tillich, Nicolas Sendrier, and Thomas Debris for useful discussions and pointers, and the anonymous FOCS reviewers for helpful suggestions  ... 
doi:10.1109/focs46700.2020.00103 fatcat:eqi522uulnbrtfgl6j2gvsvkra

Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation [chapter]

Yu Chen, Yuyu Wang, Hong-Sheng Zhou
2018 Advances in Industrial Control  
[GKPV10] proved that the LWE assumption itself is leakage-resilient and then built a leakage-resilient secret-key encryption from it. Akavia et al.  ...  chosen independently and x still has high min-entropy given leakage z. 3 Goldreich-Levin theorem can be interpreted as a leakage-resilient assumption, which states that if h is oneway then hc(x) is pseudorandom  ...  For concrete relations, we may obtain hc with linear number of hardcore bits by either iterating a one-way permutation or relying on decisional assumptions.  ... 
doi:10.1007/978-3-030-03329-3_20 fatcat:smqhwdi2pvgkrmskqdon6zrjmi

Data Encryption Standard (DES) [chapter]

Alex Biryukov, Christophe De Cannière, William E. Winkler, Charu C. Aggarwal, Markus Kuhn, Luc Bouganim, Yanli Guo, Bart Preneel, Gerrit Bleumer, Tor Helleseth, Ran Canetti, Mayank Varia (+35 others)
2011 Encyclopedia of Cryptography and Security  
Therefore the Decisional Diffie-Hellman assumption was formulated, as follows: The Decisional Diffie-Hellman (DDH) Problem: Given a group G, a generator g of G, and three elements a, b, c ∈ G, decide whether  ...  Note that all bits in DES are numbered from left to right, i.e., the leftmost bit of a block (the most significant bit) is bit 1. 1. Expansion (E).  ...  The signature scheme is based on the ElGamal digital signature scheme and borrows ideas from Schnorr digital signatures for reducing signature size.  ... 
doi:10.1007/978-1-4419-5906-5_568 fatcat:wly6ca3tv5e2pc2woejsoaoubm

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions [chapter]

Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang
2016 Lecture Notes in Computer Science  
These tools provide similar advantages to those of structure-preserving signatures in the realm of bilinear groups.  ...  This work provides new tools enabling the design of anonymous authentication systems whereby new users can join the system at any time.  ...  The first author was funded by the "Programme Avenir Lyon Saint-Etienne de l'Université de Lyon" in the framework of the programme "Investissements d'Avenir" (ANR-11-IDEX-0007).  ... 
doi:10.1007/978-3-662-53890-6_13 fatcat:ylu5kgpmefejlfejjsqj7ewfda

Data Service Outsourcing and Privacy Protection in Mobile Internet [chapter]

Zhen Qin, Erqiang Zhou, Yi Ding, Yang Zhao, Fuhu Deng, Hu Xiong
2018 Data Service Outsourcing and Privacy Protection in Mobile Internet  
Preface The data of mobile Internet have the characteristics of large scale, variety of patterns, complex association and so on.  ...  On the one hand, it needs efficient data processing model to provide support for data services, and on the other hand, it needs certain computing resources to provide data security services.  ...  In [177] the Waters scheme is proven secure under the decisional q-parallel BDHE assumption.  ... 
doi:10.5772/intechopen.79903 fatcat:kvdisoudirgdhd7tvscnhsb6gm

Data Security and Privacy Protection for Cloud Storage: A Survey

Pan Yang, Neal N. Xiong, Jingli Ren
2020 IEEE Access  
The continuous growth of data storage pressure drives the rapid development of the entire storage market on account of massive data generated.  ...  The new development trends including Internet of Things (IoT), smart city, enterprises digital transformation and world's digital economy are at the top of the tide.  ...  Cheung and Newport [21] presented an improved scheme based on [7] , which is proved to be CPA secure and CCA secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption.  ... 
doi:10.1109/access.2020.3009876 fatcat:6kcb3junlzhvvcq3qhztumpdqq

Secure Sharing of Partially Homomorphic Encrypted IoT Data

Hossein Shafagh, Anwar Hithnawi, Lukas Burkhalter, Pascal Fischli, Simon Duquennoy
2017 Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems - SenSys '17  
IoT applications often utilize the cloud to store and provide ubiquitous access to collected data.  ...  To address these concerns, we present Pilatus, a data protection platform where the cloud stores only encrypted data, yet is still able to process certain queries (e.g., range, sum).  ...  This work was partly supported by a grant from CPER Nord-Pas-de-Calais/FEDER DATA and VINNOVA, Sweden's innovation agency.  ... 
doi:10.1145/3131672.3131697 dblp:conf/sensys/ShafaghHBFD17 fatcat:55mwjscqsbdulbl2yl3z5bh7oe

Traitor Tracing with Optimal Transmission Rate [chapter]

Nelly Fazio, Antonio Nicolosi, Duong Hieu Phan
Lecture Notes in Computer Science  
non-standard assumptions for bilinear groups.  ...  Our construction relies on the decisional bilinear Diffie-Hellman assumption, and attains the same features of public traceability as (a repaired variant of) [CPP05], which is less efficient and requires  ...  Preliminaries The security properties of our construction hinge upon the decisional bilinear Diffie-Hellman assumption (DBDH) for (G 1 , G 2 ).  ... 
doi:10.1007/978-3-540-75496-1_5 fatcat:e4p652p4mne67kab6njbbs5bra
« Previous Showing results 1 — 15 out of 42 results