Filters








271 Hits in 6.1 sec

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems [chapter]

Benny Applebaum, David Cash, Chris Peikert, Amit Sahai
2009 Lecture Notes in Computer Science  
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes.  ...  In addition, by combining our constructions with prior ones, we get fast implementations of several other primitives and protocols.  ...  Circular-secure encryption schemes.  ... 
doi:10.1007/978-3-642-03356-8_35 fatcat:qfnfooe4gndl5cdxaov7z6iotq

Efficient Lattice-Based Cryptosystems with Key Dependent Message Security

Bo Yang, Ruwei Huang, Jianan Zhao
2021 Applied Sciences  
Most of the current KDM security schemes are based on traditional hard mathematical problems, where the public key and ciphertext are not compact enough, and make the ciphertext size grow linearly with  ...  It remains hard after the modification from the RLWE problem.  ...  Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.  ... 
doi:10.3390/app112412161 fatcat:uijmkhvcc5amvmiyf5knsqrhhu

An overview of cryptographic primitives for possible use in 5G and beyond

Jing Yang, Thomas Johansson
2020 Science China Information Sciences  
AbstractThis survey overviews the potential use of cryptographic primitives in the fifth-generation mobile communications system (aka 5G) and beyond.  ...  It shows the use of current cryptographic algorithms and discusses new algorithms or modifications of existing ones, that can be relevant.  ...  Existing recent such authentication protocols are often based on the hardness of the learning parity with noise (LPN) problem, a problem not known to be efficiently solved by a quantum computer.  ... 
doi:10.1007/s11432-019-2907-4 fatcat:bdapglaflnc75mzmmlxcb64veq

Homomorphic Encryption — Theory and Application [chapter]

Jaydip Sen
2013 Theory and Practice of Cryptography and Network Security Protocols and Technologies  
All known fully homomorphic encryption schemes are based on hardness of lattice problems.  ...  primitives whose security can formally be reduced to the hardness of short-vector problems in ideal lattices.  ... 
doi:10.5772/56687 fatcat:amgaohpdbnal3ly6nsx4nvasmm

Multivariate Cryptosystems for Secure Processing of Multidimensional Signals [article]

Alberto Pedrouzo-Ulloa, Juan Ramón Troncoso-Pastoriza, Fernando Pérez-González
2017 arXiv   pre-print
This work introduces a new cryptographic hard problem denoted m-RLWE (multivariate Ring Learning with Errors) which generalizes RLWE, and proposes several relinearization-based techniques to efficiently  ...  The proposed hard problem and the developed techniques give support to lattice cryptosystems that enable encrypted processing of multidimensional signals and efficient conversion between different structures  ...  PRELIMINARIES The state of the art in FHE is based on the Learning with Errors (LWE) [17] and Ring Learning with Errors (RLWE) problems [18] , which have proven security reductions from hard lattice  ... 
arXiv:1712.00848v1 fatcat:qvwgu44yeffyxf3p46k6jruzsa

Homomorphic Encryption: Theory & Applications [article]

Jaydip Sen
2013 arXiv   pre-print
A significant number of propositions on fully homomorphic encryption is then discussed.  ...  After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography.  ...  All known fully homomorphic encryption schemes are based on hardness of lattice problems.  ... 
arXiv:1305.5886v1 fatcat:agzyco4ehnfajiamrbp7qobo2a

LifeLine for FPGA Protection: Obfuscated Cryptography for Real-World Security

Florian Stolz, Nils Albartus, Julian Speith, Simon Klix, Clemens Nasenberg, Aiden Gula, Marc Fyrbiak, Christof Paar, Tim Güneysu, Russell Tessier
2021 Transactions on Cryptographic Hardware and Embedded Systems  
We then describe the design and implementation of novel hardware obfuscation primitives based on the intrinsic structure of FPGAs.  ...  Based on our primitives, we design and implement LifeLine, a hardware design protection mechanism for FPGAs using hardware/software co-obfuscated cryptography.  ...  Hardware/Software Co-Obfuscation Since the partial bitstream is encrypted based on a (symmetric) encryption algorithm, we have to generate the cryptographic key in a secure manner.  ... 
doi:10.46586/tches.v2021.i4.412-446 fatcat:tvapiwiqojhq7hbecgzgk7at5y

PakeMail: authentication and key management in decentralized secure email and messaging via PAKE [article]

Itzel Vazquez Sandoval, Arash Atashpendar, Gabriele Lenzini, Peter Y.A. Ryan
2021 arXiv   pre-print
enhancements and security properties, which are hard to achieve using out-of-band (OOB) authentication.  ...  We then propose tackling public key authentication by solving the problem of "secure equality test" using PAKE, and discuss various protocols and their properties.  ...  We discuss schemes based on the Ring Learning With Errors (RLWE) problem, a special case of the Learning With Errors (LWE) problem whose security may be reducible to the hardness of solving the Shortest  ... 
arXiv:2107.06090v1 fatcat:52kswe5h4vh33m5xzsqdsvnq4a

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages [chapter]

Zvika Brakerski, Vinod Vaikuntanathan
2011 Lecture Notes in Computer Science  
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems on ideal lattices.  ...  Specifically, he was able to reduce the security of his somewhat homomorphic encryption scheme to the worst-case hardness of standard problems (such as the shortest vector problem) on ideal lattices [15  ...  We thank Chris Peikert for providing us with a full version of [26] , and Nigel Smart and the anonymous CRYPTO reviewers for numerous insightful comments on the draft.  ... 
doi:10.1007/978-3-642-22792-9_29 fatcat:gjzunbjw55h53fbe2dxkcqnm7y

A Decade of Lattice Cryptography

Chris Peikert
2016 Foundations and Trends® in Theoretical Computer Science  
Lattice-based cryptography is the use of conjectured hard problems on point lattices in R n as the foundation for secure cryptographic systems.  ...  The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case  ...  I warmly thank Vadim Lyubashevsky, Dieter van Melkebeek, Oded Regev, Noah Stephens-Davidowitz, Madhu Sudan, and an anonymous reviewer for many valuable comments on earlier drafts.  ... 
doi:10.1561/0400000074 fatcat:5orjj3lrufdalfufl7ju6rnz3e

A Review of Deep Learning Security and Privacy Defensive Techniques

Muhammad Imran Tariq, Nisar Ahmed Memon, Shakeel Ahmed, Shahzadi Tayyaba, Muhammad Tahir Mushtaq, Natash Ali Mian, Muhammad Imran, Muhammad W. Ashraf
2020 Mobile Information Systems  
In our daily life, we used many applications that use Deep Learning models to make decisions based on predictions, and if Deep Learning models became the cause of misprediction due to internal/external  ...  The Deep Learning has numerous advantages including fast solving complex problems, huge automation, maximum application of unstructured data, ability to give high quality of results, reduction of high  ...  We explained both security and private attacks, frameworks, and countermeasure techniques. ese frameworks have cryptographic primitives and numerous characteristics.  ... 
doi:10.1155/2020/6535834 fatcat:37wc35bqcnavdd2u4622sxmiom

Securing Low-cost RFID Systems: A Research Survey

Qi Chai
2014 International Journal of RFID Security and Cryptography  
and privacy purposes. • Design of new cryptographic primitives/protocols, e.g., stream/block ciphers, hash functions, authentication methods, by: (1) optimizing implementations of standardized and trusted  ...  Although this technology has many catching and exclusive characteristics, security and privacy issues associated are not easy to address due to tags' modest computational and storage capabilities and the  ...  The security is reduced to the difficulty of the Learning Parity with Noise (LPN) problem, which has been proven to be NP-hard.  ... 
doi:10.20533/ijrfidsc.2046.3715.2014.0015 fatcat:skq7whrbwffhjf22v6ub672al4

Efficient Secure Computation with Garbled Circuits [chapter]

Yan Huang, Chih-hao Shen, David Evans, Jonathan Katz, Abhi Shelat
2011 Lecture Notes in Computer Science  
Several open problems remain, but as theory and pragmatism advance, secure computation is approaching the point where it offers practical solutions for a wide variety of important problems.  ...  We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacypreserving applications.  ...  The contents of this paper do not necessarily reflect the position or the policy of the US Government, and no official endorsement should be inferred.  ... 
doi:10.1007/978-3-642-25560-1_2 fatcat:nimee4aiqrhqtgdtqgqj2scg64

Privacy-preserving neural networks with Homomorphic encryption: Challenges and opportunities

Bernardo Pulido-Gaytan, Andrei Tchernykh, Jorge M. Cortés-Mendoza, Mikhail Babenko, Gleb Radchenko, Arutyun Avetisyan, Alexander Yu Drozdov
2021 Peer-to-Peer Networking and Applications  
Modern encryption techniques ensure security and are considered as the best option to protect stored data and data in transit from an unauthorized third-party.  ...  We focus on the privacy-preserving homomorphic encryption cryptosystems targeted at neural networks identifying current solutions, open issues, challenges, opportunities, and potential research directions  ...  Acknowledgments This work was supported by the Ministry of Education and Science of the Russian Federation (Project 075-15-2020-788).  ... 
doi:10.1007/s12083-021-01076-8 fatcat:4ol6i5goizezxfbu24clxlfugu

ANCHOR: logically-centralized security for Software-Defined Networks [article]

Diego Kreutz and Jiangshan Yu and Fernando M. V. Ramos and Paulo Esteves-Verissimo
2018 arXiv   pre-print
To show the effectiveness of the concept, we focus on 'security' in this paper: we identify the current security gaps in SDNs and we populate the architecture middleware with the appropriate security mechanisms  ...  Though addressing the latter in an ad-hoc, piecemeal way, may work, it will most likely lead to efficiency and effectiveness problems.  ...  Secure cryptographic key generators Based on the algorithm proposed in [72] , we have implemented an iDVV-based secure cryptographic keys generator that supports seven different cryptographic primitives  ... 
arXiv:1711.03636v4 fatcat:kj36szj455anrg4dfjlfpuq5vi
« Previous Showing results 1 — 15 out of 271 results