Compact Ring Signatures from LWE - CRYPTO 2021 Research
Research presented at CRYPTO 2021 introduces a compact ring signature scheme using components instantiated from LWE. The scheme allows each signer to sign on behalf of a ring of users, offering properties of unforgeability, anonymity, and compactness. The work explores the possibility of building co
0 views • 25 slides
Limits on the Efficiency of Ring LWE-based Key Exchange
This study explores the limitations of Ring LWE-based key exchange protocols and their impact on non-interactive key exchange mechanisms. It discusses the LWE assumption, noise distribution, and the practical implications of small moduli q and noise-to-modulus ratio r. Additionally, it delves into P
0 views • 71 slides
Signatures, Commitments, and Zero-Knowledge in Lattice Problems
Explore the intricacies of lattice problems such as Learning With Errors (LWE) and Short Integer Solution (SIS), and their relation to the Knapsack Problem. Delve into the hardness of these problems and their applications in building secure cryptographic schemes based on polynomial rings and lattice
3 views • 44 slides
Overview of BIKE Key Exchange Protocol by Ray Perlner
The BIKE (Bit-Flipping Key Exchange) protocol, presented by Ray Perlner, offers variants based on MDPC codes like McEliece and Niederreiter with a focus on quasi-cyclic structures. These non-algebraic codes show promise for key reduction, targeting IND-CPA security. The protocol features competitive
2 views • 18 slides
Public-key Encryption and LWE: Foundations and Security Theorems
Covering topics such as public-key encryption from LWE, homomorphic encryption, LWE with small secrets, and security theorems. The lecture explores the complexities and applications of cryptographic systems built on lattice-based assumptions, delving into encryption schemes, key generation, decrypti
0 views • 21 slides
Comprehensive Framework for Lattice-Based ABE Using Evasive Inner-Product Encryption
This content delves into a comprehensive framework for Attribute-Based Encryption (ABE) based on lattice structures and evasive inner-product functional encryption. It explores various modalities like Key-Policy ABE and Ciphertext-Policy ABE, along with constructions and assumptions related to Evasi
0 views • 22 slides
Private Information Retrieval with Client Preprocessing: Construction and Bounds
Explore the concept of Private Information Retrieval (PIR) with client-side preprocessing, information-theoretic constructions, lower bounds, and various constructions under different assumptions like DDH, LWE, QR, and more. Discover the trade-offs between client efficiency, server efficiency, hint
0 views • 13 slides
Lower Bound for Proving Hardness of Learning with Rounding
Explore the complexities of learning with rounding in cryptographic systems, including LWE and LWR problems, fundamental hardness assumptions, and constructions of deterministic cryptosystems. Can we directly construct pseudo-random functions from LWR? Delve into the challenges and implications in m
0 views • 92 slides
Empowering Open Science: Enhancing FAIR Data Management with LifeBlock
Explore LifeBlock's impact on EOSC through FAIR data management, storage, and generation. Discover key features such as simple search engine, FAIR principles adherence, efficient blockchain system, and integration with other LWE services. Designed for researchers, policy makers, and developers to ac
0 views • 8 slides