A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
Explore a new paradigm for public-key functional encryption, focusing on degree-2 polynomials. Learn about filtering encrypted emails and advancements in cryptographic techniques.
Boosting Verifiable Computation on Encrypted Data
Explore verifiable computation on encrypted data, covering homomorphic encryption, SNARKs, and polynomial commitments for secure and private delegation of computation.
Generic Authenticated Key Exchange in the Quantum Random Oracle Model
Explores authenticated key exchange in quantum settings, addressing limitations of prior work and proposing a new security model for 2-move protocols in the Quantum Random Oracle Model.
Fine-Grained Cryptography: A New Frontier?
Explore fine-grained cryptography's frontier with Alon Rosen. Delve into public key encryption, polynomial proofs of work, and MA proof systems, uncovering new possibilities in cryptographic complexity.
Quantum Cryptography
Explore quantum cryptography's technical aspects, future applications, and threat models in this comprehensive overview of cutting-edge security technology.
Secure Computation
Explore resource-restricted cryptography, efficient constructions, and secure computation techniques in this comprehensive overview of advanced cryptographic concepts.
Quantum Cryptanalysis
Explore quantum cryptanalysis techniques, including key search and optimal merging, and their impact on cryptographic security in the quantum computing era.
Compact Adaptively Secure ABE from k-Lin - Beyond NC1 and Towards NL
Explores advanced cryptographic techniques for Attribute-Based Encryption, focusing on adaptive security and expanding beyond NC1 circuits towards NL complexity class.
New Constructions of Statistical NIZKs - Dual-Mode DV-NIZKs and More
Explore advanced statistical NIZKs, including dual-mode DV-NIZKs, in cryptography. Learn about new constructions, security implications, and open questions in this cutting-edge field.
Compact NIZKs from Standard Assumptions on Bilinear Maps
Explore advanced cryptographic techniques for compact non-interactive zero-knowledge proofs using bilinear maps, focusing on novel constrained signature methods and efficiency improvements.
Friet- An Authenticated Encryption Scheme with Built-in Fault Detection
Explore an authenticated encryption scheme with fault detection capabilities, covering its design, implementation, and resistance to fault injection attacks.
SPARKs - Succinct Parallelizable Arguments of Knowledge
Explore cutting-edge cryptographic techniques with SPARKs, a novel paradigm for efficient and parallelizable arguments of knowledge, presented at Eurocrypt 2020.
Low Weight Discrete Logarithms and Subset Sum in - with Polynomial Memory
Explore advanced cryptographic algorithms for discrete logarithms and subset sum problems, focusing on low-weight instances and memory-efficient techniques.
On Instantiating the Algebraic Group Model from Falsifiable Assumptions
Explore the Algebraic Group Model in cryptography, covering representation, rerandomization, and applications to Schnorr Signatures. Gain insights into recent research and open questions in this field.
Security of Hedged Fiat-Shamir Signatures under Fault Attacks
Explore fault attacks on hedged Fiat-Shamir signatures, analyzing vulnerabilities and proposing countermeasures for enhanced cryptographic security in digital signature schemes.
Two-Round Oblivious Transfer from CDH or LPN
Explore advanced cryptographic protocols: two-round oblivious transfer based on CDH or LPN. Learn about simulation-based security, receiver security, and applications in search and indistinguishable OT.
How to Extract Useful Randomness from Unreliable Sources
Explore techniques for extracting randomness from unreliable sources, including multi-source extraction, adversarial models, and applications in cryptography. Learn about somewhere-random sources and their potential.
Private Information Retrieval with Sublinear Online Time
Explore efficient private information retrieval protocols with sublinear online time, focusing on communication complexity, computation complexity, and security proofs in cryptographic systems.
Broadcast-Optimal Two-Round MPC
Explore secure multiparty computation, focusing on two-round protocols. Analyze impossibility results, lower bounds, and feasibility in broadcast-optimal settings.
Fractal - Post-Quantum and Transparent Recursive Proofs from Holography
Explore post-quantum cryptography and transparent recursive proofs using holography, focusing on the Fractal system's foundations, implementation, and practical applications in cryptographic security.
Key-Homomorphic Pseudorandom Functions from LWE with Small Modulus
Explore key-homomorphic pseudorandom functions based on Learning With Errors, focusing on small modulus applications, security implications, and potential limitations in cryptographic systems.