Filters








18 Hits in 8.7 sec

XPIR : Private Information Retrieval for Everyone

Carlos Aguilar-Melchor, Joris Barrier, Laurent Fousse, Marc-Olivier Killijian
2016 Proceedings on Privacy Enhancing Technologies  
Using the paradigm shift introduced by lattice-based cryptography, we show that the conclusion of Sion and Carbunar is not valid anymore: cPIR is of practical value.  ...  A Private Information Retrieval (PIR) scheme is a protocol in which a user retrieves a record from a database while hiding which from the database administrators.  ...  More precisely, in [8] , Lipmaa proves that using a particular representation, this lower bound is slightly sub-linear (in O(n/log(log(n))).  ... 
doi:10.1515/popets-2016-0010 dblp:journals/popets/MelchorBFK16 fatcat:kg3ueyoy3vebjjyrm5tiwn5uci

A Survey on Homomorphic Encryption Schemes: Theory and Implementation [article]

Abbas Acar, Hidayet Aksu, A. Selcuk Uluagac, Mauro Conti
2017 arXiv   pre-print
Then, the main FHE families, which have become the base for the other follow-up FHE schemes are presented.  ...  Indeed, Homomorphic Encryption (HE), a special kind of encryption scheme, can address these concerns as it allows any third party to operate on the encrypted data without decrypting it in advance.  ...  In the LWE-based FHE schemes, an important step towards to a practical FHE scheme is made in ].  ... 
arXiv:1704.03578v2 fatcat:zllpjmbaxrfbdnfkxcpoupgkxm

A Practical Implementation of Identity-Based Encryption Over NTRU Lattices [chapter]

Sarah McCarthy, Neil Smyth, Elizabeth O'Sullivan
2017 Lecture Notes in Computer Science  
User Key Extraction demonstrates a 180% speed increase and Encrypt and Decrypt demonstrate increases of over 500% and 1200% respectively for 80-bit security on an Intel Core i7-6700 CPU at 4.0 GHz, with  ...  An identity-based encryption scheme enables the efficient distribution of keys in a multi-user system.  ...  Acknowledgements The authors would like to thank the anonymous reviewers of SAC 2017 and IMACC 2017 for their careful reading of the paper and their diligent comments.  ... 
doi:10.1007/978-3-319-71045-7_12 fatcat:6sl6mpecijdldazju3ankwqlrq

A New Crypto-classifier Service for Energy Efficiency in Smart Cities

Oana Stan, Mohamed-Haykel Zayani, Renaud Sirdey, Amira Ben Hamida, Alessandro Ferreira Leite, Mallek Mziou-Sallami
2018 Proceedings of the 7th International Conference on Smart Cities and Green ICT Systems  
decrypt it.  ...  We assess our proposal atop of real data taken from an Irish residential district and we show that our service can achieve acceptable performances in terms of security, execution times and memory requirements  ...  One can also use the so-called leveled homomorphic cryptosystems, such as the Ring-LWE-based (e.g. (Brakerski et al., 2011) ), more complex but with more computing capabilities and quantum-safe.  ... 
doi:10.5220/0006697500780088 dblp:conf/smartgreens/StanZSHLM18 fatcat:4dgwghchzzbtfiidz3kv4onxli

O2MD2: A new post-quantum cryptosystem with one-to-many distributed key management based on prime modulo double encapsulation

Ricardo Neftali Pontaza Rodas, Ying-Dar Lin, Shih-Lien Lu, Keh-Jeng Chang
2021 IEEE Access  
Computationally hard problems defined on lattices have been proposed as the fundamental security bases for a new type of cryptography.  ...  We compare our solution's speed against the speed of the twenty-six different implementations from seven popular candidates in the NIST project, and our cryptosystem performs from 2 to 4 orders of magnitude  ...  The received ciphertext is split in four sub-ciphertexts and decrypted using the receiver's private key, generating four decrypted sub-messages equal to the original encrypted message is returned.  ... 
doi:10.1109/access.2021.3100551 fatcat:mfco5733lfew7pkunbhbakqgzm

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
One alternative is lattice-based cryptography which allows the construction of asymmetric public-key encryption and signature schemes that offer a good balance between security, performance, and key as  ...  AbstractAlmost all practically relevant asymmetric cryptosystems like RSA or ECC are either based on the hardness of factoring or on the hardness of the discrete logarithm problem.  ...  ., the largest variant for n = 320 already consumes more than 21.7/9.8 million cycles for encryption/decryption.  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y

Practical Data-in-use Protection using Binary Decision Diagrams

Oleg Mazonka, Esha Sarkar, Eduardo Chielle, Nektarios Georgios Tsoutsos, Michail Maniatakos
2020 IEEE Access  
Therefore, our work provides a more efficient alternative to FHE schemes that can be used for general-purpose computation.  ...  Cryptography advances such as Fully Homomorphic Encryption (FHE) provide theoretical, albeit impractical, solutions to functionally-complete computation over encrypted operands, necessary for general-purpose  ...  We performed experiments for λ from 4 to 30 for constructed encrypter model and leaked encrypter model. The experiments were performed on a 3.33 GHz Intel Xeon CPU with 96GB of RAM and 24 CPU cores.  ... 
doi:10.1109/access.2020.2970120 fatcat:v2vsmqwykzcyhedowufxb6azse

Function Secret Sharing [chapter]

Elette Boyle, Niv Gilboa, Yuval Ishai
2015 Lecture Notes in Computer Science  
This constrcution too can be based on any PRG. -FSS for simple functions.  ...  Thus, an FSS for F can be thought of as method for succinctly performing an "additive secret sharing" of functions from F .  ...  We thank Nir Bitansky and Vinod Vaikuntanathan for helpful discussions and for pointing out the relevance of [13] .  ... 
doi:10.1007/978-3-662-46803-6_12 fatcat:pmtep7ikkbhqbioxjjx4pl2okq

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization [chapter]

Prabhanjan Ananth, Abhishek Jain, Amit Sahai
2017 Lecture Notes in Computer Science  
Our results rely on the existence of sub-exponentially secure iO for circuits and re-randomizable encryption schemes.  ...  In order to obtain these results, we develop a new template for obfuscating Turing machines that is of independent interest and has recently found application in subsequent work on patchable obfuscation  ...  There exists an succinct iO scheme, assuming the existence of sub-exponentially secure iO for circuits and sub-exponentially secure re-randomizable encryption schemes (which can be based on DDH, LWE).  ... 
doi:10.1007/978-3-319-63715-0_9 fatcat:e5n22nq7czdcdbz2adcdk3kh3e

From Selective to Adaptive Security in Functional Encryption [chapter]

Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
2015 Lecture Notes in Computer Science  
In some cases, such as attribute-based encryption for circuits, it is still not known how to implement dual system encryption to achieve adaptive security (although Garg, Gentry, Halevi and Zhandry [GGH  ...  , as well as an adaptively-secure functional encryption scheme for linear functions [LOS + 10].  ...  Lastly, we hope that our methods will be extended towards weaker forms of functional encryption schemes for which adaptive security is yet unattained generically, such as attribute-based encryption for  ... 
doi:10.1007/978-3-662-48000-7_32 fatcat:2mrjlpft7rekna5r6pbb4nciam

Cryptography for Parallel RAM from Indistinguishability Obfuscation

Yu-Chi Chen, Sherman S.M. Chow, Kai-Min Chung, Russell W.F. Lai, Wei-Kai Lin, Hong-Sheng Zhou
2016 Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science - ITCS '16  
Namely,P always outputs encrypted CPU states and memory, and on (authenticated) input of ciphtertexts, performs decryption before the actual computation.  ...  Sub-exponentially secure CiO-PRAM implies sub-exponentially secure iO for PRAM.  ...  For example, can we construct attribute-based encryptions and functional encryptions for PRAM based on the learning with errors (LWE) assumption?  ... 
doi:10.1145/2840728.2840769 dblp:conf/innovations/ChenCCLLZ16 fatcat:cfa7xtsypfhulof2diazknhn7m

Efficient and Secure Data Sharing Using Attribute-based Cryptography [article]

MASOOMEH SEPEHRI
2018
More specifically, we propose two extended schemes of IPE : in the first extended scheme, we propose an inner-product proxy re-encryption (IPPRE ) protocol derived from a well-known innerproduct encryption  ...  The second part of this thesis presents a new lightweight secure data sharing scheme based on attribute-based cryptography for a specific IoTbased healthcare application.  ...  identity-based proxy re-encryption (IBPRE ) and attribute-based proxy re-encryption (ABPRE ).  ... 
doi:10.13130/sepehri-masoomeh_phd2018-02-28 fatcat:5jone24k5redxk5lm26ifqunnm

Mobile Network and Cloud Based Privacy-Preserving Data Aggregation and Processing

MR Baharon
2017
ACKNOWLEDGEMENTS I would like to thank my director of study, Professor Qi Shi, for his support and guidance of this thesis.  ...  He has been providing invaluable suggestions and encouragement from the beginning of my research. This completed thesis would never be possible without his help and support.  ...  LWE is a problem to recover a secret ∈ ℤ given a sequence of 'approximate' random linear equations on [161] .  ... 
doi:10.24377/ljmu.t.00007244 fatcat:egt77wy6hzdvncrpd5qcjeawua

Full Text PDF of The JBBA, Volume 2 Issue 2, October 2019

Naseem Naqvi
2019 The Journal of British Blockchain Association  
private communications and data decrypted even if it is ten years away.  ...  This second-round submission is based on the hardness of the decisional Ring Learning With Errors (R-LWE) problem. qTESLA utilizes two approaches for parameter generation that includes heuristic and provablysecure  ...  This require more investments (more of which later) and a more centralized organization with more control and governance mechanisms. However, the world of art is not without its problems.  ... 
doi:10.31585/jbba-2-2-(full)2019 fatcat:lsnv4wnuhvhpne33puatdc4p4e

Improved Efficiency of a Linearly Homomorphic Cryptosystem [article]

Parthasarathi Das, University Of Calgary, Michael J. Jacobson, Renate Scheidler
2019
When compared to the cryptosystems of Paillier and Bresson et al. at the same security levels, the basic version of Castagnos and Laguillaumie is the fastest at high security levels for small messages.  ...  Numerical results obtained with an optimized C implementation demonstrate that this variation improves performance when large messages and exponents are used.  ...  Other projects include testing the CL schemes against schemes based on Learning With Errors (LWE) [38] and Elgamal Elliptic Curve based schemes [29] .  ... 
doi:10.11575/prism/36960 fatcat:l35kswcghvajbhigj2ek3nlbym
« Previous Showing results 1 — 15 out of 18 results