OPAQUE - An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks
Explore OPAQUE, an advanced asymmetric PAKE protocol designed to enhance password authentication security against pre-computation attacks in client-server settings.
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
Explore innovative cryptographic techniques for efficient forward-secret 0-RTT key exchange using Bloom Filter Encryption, as presented at Eurocrypt 2018.
Fuzzy Password-Authenticated Key Exchange
Explore innovative cryptographic techniques for secure key exchange using fuzzy passwords, including applications, constructions, and privacy-correctness tradeoffs in dual execution scenarios.
Supersingular Isogeny Graphs and Endomorphism Rings - Reductions and Solutions
Explore supersingular isogeny graphs and endomorphism rings, discussing their applications in cryptography and potential vulnerabilities to quantum computing attacks.
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
Explore quasi-optimal SNARGs and linear multi-prover interactive proofs in cryptography, covering key concepts, implementations, and open challenges in this cutting-edge field.
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
Explore efficient designated-verifier non-interactive zero-knowledge proofs of knowledge, covering NIZK landscapes, compilers, and novel techniques for cryptographic protocol design.
Thirty Years of Digital Currency - From Digicash to the Blockchain
Explore the evolution of digital currencies from Digicash to blockchain, examining successes, failures, and future challenges in cryptocurrency development and adoption.
An Efficiency-Preserving Transformation from ...
Explore an efficiency-preserving transformation in cryptography, presented at Eurocrypt 2018, delving into advanced concepts and their implications for secure systems.
On the Existence of Three Round Zero-Knowledge Proofs
Explore the intricacies of three-round zero-knowledge proofs, delving into complexity, compression, and verification methods in cryptography.
Limits on Low-Degree Pseudorandom Generators - Or - Sum-of-Squares Meets Program Obfuscation
Explore the intersection of sum-of-squares and program obfuscation, examining limitations of low-degree pseudorandom generators in cryptography and complexity theory.
Obfustopia Built on Secret-Key Functional Encryption
Explore advanced cryptographic techniques: obfuscation, functional encryption, and their applications in building secure systems. Gain insights from cutting-edge research presented at Eurocrypt 2018.
A New Approach to Black-Box Concurrent Secure Computation
Explore innovative techniques for enhancing privacy and security in concurrent computations, focusing on black-box protocols and their applications in cryptography.
Adaptively Secure Garbling with Near Optimal Online Complexity
Learn about adaptively secure garbling schemes with near-optimal online complexity, exploring key concepts, techniques, and their significance in cryptography and secure computation.
Dissection BKW
Explore the Dissection BKW algorithm, a cryptographic technique presented at Crypto 2018, and its implications for solving the Learning with Errors problem.
Constrained PRFs for NC1 in Traditional Groups
Explore constrained pseudorandom functions for NC1 circuits in traditional groups, advancing cryptographic techniques for secure computation and access control.
Yes, There is an Oblivious RAM Lower Bound!
Explore groundbreaking research on Oblivious RAM, uncovering a significant lower bound that challenges previous assumptions and advances our understanding of secure data access patterns.
On the Exact Round Complexity of Secure Three Party Computation
Explore the precise round complexity of secure three-party computation protocols, examining theoretical advancements and practical implications in cryptography.
Multi Theorem Preprocessing NIZKs from Lattices
Explore innovative lattice-based cryptography techniques for multi-theorem preprocessing NIZKs, advancing secure communication and privacy-preserving protocols.
Lower Bounds on Lattice Enumeration with Extreme Pruning
Explore advanced techniques in lattice-based cryptography, focusing on lower bounds for enumeration algorithms with extreme pruning to enhance security analysis.
Lattice Based Zero Knowledge Arguments for Integer Relations
Explore lattice-based zero-knowledge proofs for integer relations, examining innovative cryptographic techniques and their applications in secure communication systems.
Beyond Permutation Branching Programs - Proofs, Attacks and Candidates
Explore advanced cryptographic concepts, including proofs, attacks, and candidates for GGH15 beyond permutation branching programs in this research presentation.