Surveys most of the major developments in lattice cryptography over the past ten years. The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems, their provable hardness assuming the worst-case intractability of standard lattice problems, and their many cryptographic applications.
This book focuses on lattice-based cryptosystems, widely considered to be one of the most promising post-quantum cryptosystems and provides fundamental insights into how to construct provably secure cryptosystems from hard lattice problems. The concept of provable security is used to inform the choice of lattice tool for designing cryptosystems, including public-key encryption, identity-based encryption, attribute-based encryption, key change and digital signatures. Given its depth of coverage, the book especially appeals to graduate students and young researchers who plan to enter this research area.
Bachelor Thesis from the year 2014 in the subject Engineering - Computer Engineering, grade: 1,0, Hamburg University of Technology (Institut für Eingebettete Systeme), language: English, abstract: The aim of this thesis is to identify the characteristics of lattice-based cryptosystems. The use of encryption and signature schemes can be insecure considering attacks by a quantum computer and inefficient in the computation time. An alternative cryptography is proposed, which is based on worst-case lattice problems. The security and the hardness of the underlying computational problems will be analyzed by providing collaboration between the linear-algebra, complexity-theory and the public-key cryptography.
The main focus of the book will graduate level courses on the techniques used in obtaining lattice-based cryptosystems. The book will first cover the basics of lattices and then introduce the more advanced material (e.g. Gaussian distributions, sampling, algebraic number theory, etc.) in a "natural" way, motivated by cryptographic constructions. There will also be a fair amount of mathematics that will be introduced gradually and will be motivated by cryptographic constructions.
Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.
This book constitutes the thoroughly refereed post-proceedings of the International Conference on Cryptography and Lattices, CaLC 2001, held in Providence, RI, USA in March 2001. The 14 revised full papers presented together with an overview paper were carefully reviewed and selected for inclusion in the book. All current aspects of lattices and lattice reduction in cryptography, both for cryptographic construction and cryptographic analysis, are addressed.
This book constitutes the refereed proceedings of the Second International Workshop on Post-Quantum Cryptography, PQCrypto 2008, held in Cincinnati, OH, USA, in October 2008. The 15 revised full papers presented were carefully reviewed and selected from numerous submissions. Quantum computers are predicted to break existing public key cryptosystems within the next decade. Post-quantum cryptography is a new fast developing area, where public key schemes are studied that could resist these emerging attacks. The papers present four families of public key cryptosystems that have the potential to resist quantum computers: the code-based public key cryptosystems, the hash-based public key cryptosystems, the lattice-based public key cryptosystems and the multivariate public key cryptosystems.
This open access book systematically explores the statistical characteristics of cryptographic systems, the computational complexity theory of cryptographic algorithms and the mathematical principles behind various encryption and decryption algorithms. The theory stems from technology. Based on Shannon's information theory, this book systematically introduces the information theory, statistical characteristics and computational complexity theory of public key cryptography, focusing on the three main algorithms of public key cryptography, RSA, discrete logarithm and elliptic curve cryptosystem. It aims to indicate what it is and why it is. It systematically simplifies and combs the theory and technology of lattice cryptography, which is the greatest feature of this book. It requires a good knowledge in algebra, number theory and probability statistics for readers to read this book. The senior students majoring in mathematics, compulsory for cryptography and science and engineering postgraduates will find this book helpful. It can also be used as the main reference book for researchers in cryptography and cryptographic engineering areas. [Resumen de la editorial]
This book constitutes the refereed proceedings of the 20th International Conference on Information and Communications Security, ICICS 2018, held in Lille, France, in October 2018. The 39 revised full papers and 11 short papers presented were carefully selected from 202 submissions. The papers are organized in topics on blockchain technology, malware, botnet and network security, real-world cryptography, encrypted computing, privacy protection, signature schemes, attack analysis and detection, searchable encryption and identity-based cryptography, verifiable storage and computing, applied cryptography, supporting techniques, formal analysis and cryptanalysis, attack detection, and security management.
In today's interconnected digital landscape, cybersecurity threats pose significant challenges to individuals, organizations, and governments worldwide. Cyberattacks, data breaches, and malicious activities continue to escalate in sophistication and frequency, jeopardizing sensitive information, financial assets, and critical infrastructure. Amidst this escalating threat landscape, there's a pressing need for comprehensive solutions to safeguard digital assets and ensure the integrity, confidentiality, and availability of data. Traditional security measures are proving inadequate in the face of evolving cyber threats, necessitating innovative approaches to cybersecurity. Innovations in Modern Cryptography emerges as a solution to address the complex cybersecurity challenges of the digital age. This comprehensive handbook offers a deep dive into cutting-edge cryptographic techniques, algorithms, and applications that are reshaping the landscape of cybersecurity. By exploring advanced topics such as post-quantum cryptography, homomorphic encryption, and secure multi-party computation, the book equips readers with the knowledge and tools needed to mitigate cyber risks and protect sensitive data effectively.