Grover Meets Simon - Quantumly Attacking the FX Construction
Explore quantum attacks on the FX construction, combining Grover's and Simon's algorithms for cryptanalysis in this advanced cryptography presentation.
Authenticated Encryption in the Face of Protocol and Side Channel Leakage
Explore authenticated encryption's resilience against protocol and side-channel leakage, examining security notions, goals, and schemes to enhance cryptographic protection.
Analyzing Multi Key Security Degradation
Explore the security implications of multi-key systems in cryptography, examining potential vulnerabilities and degradation factors in this advanced research presentation.
The Sleepy Model of Consensus
Explore a novel consensus protocol for distributed systems, addressing challenges in blockchain and cryptocurrency networks with dynamic participation.
QDSA Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs
Explore qDSA, a compact and secure digital signature algorithm using curve-based Diffie-Hellman key pairs, presented at Asiacrypt 2017.
On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications
Explores innovative encoding techniques for predicates using arithmetic circuits, discussing their potential applications and implications for cryptographic systems.
Optimal Rate Non Committing Encryption
Explore cutting-edge cryptographic techniques for secure communication with optimal efficiency, presented by leading researchers at Asiacrypt 2017.
Non Interactive Multiparty Computation Without Correlated Randomness
Explore advanced cryptographic techniques for secure multiparty computation without correlated randomness, covering assumptions, extensions, and proofs for honest and malicious cases.
The Minimum Number of Cards in Practical Card-Based Protocols
Explores the optimization of card-based cryptographic protocols, focusing on minimizing the number of cards required for secure and practical implementations.
Succinct Spooky Compilers Are Not Black Box Sound
Explore cryptographic compilers, focusing on succinct spooky free compilers and their lack of black-box soundness in this theoretical presentation from Asiacrypt 2017.
Two Round PAKE from Approximate SPH and Instantiations from Lattices
Explore two-round password-authenticated key exchange protocols using approximate smooth projective hash and lattice-based instantiations.
Blockcipher Based MACs Beyond the Birthday Bound Without Message Length
Explore advanced cryptographic techniques for blockcipher-based MACs that surpass birthday bound limitations without relying on message length.
Tightly Secure Signatures From Five Move Identification Protocols
Explore tightly secure signatures derived from five-move identification protocols, examining their cryptographic properties and applications in secure communication systems.
Cycle Slicer - An Algorithm for Building Permutations on Special Domains
Explore an innovative algorithm for constructing permutations on specific domains, enhancing cryptographic techniques and computational efficiency.
K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
Explore advanced cryptographic techniques for secure multiparty computation, focusing on k-round protocols and their relationship to oblivious transfer and garbled interactive circuits.
Two-Round Multiparty Secure Computation from Minimal Assumptions
Explore minimal assumptions for two-round multiparty secure computation, covering protocol design, garbled circuits, and oblivious transfer in cryptographic applications.
Simple Proofs of Sequential Work
Explore innovative cryptographic techniques for verifying sequential computations, presented at Eurocrypt 2018 by Cohen and Pietrzak.
The Discrete-Logarithm Problem with Preprocessing
Explore the discrete-logarithm problem with preprocessing in cryptography, examining its implications and potential solutions as presented at Eurocrypt 2018.
Masking the GLP Lattice-Based Signature Scheme at Any Order
Explore masking techniques for the GLP lattice-based signature scheme, covering algorithm design, noninterference, data generation, and performance implications.
Non-malleable Codes from Average-Case Hardness
Explore non-malleable codes based on average-case hardness, including encoding schemes, prior work, main results, and construction overview. Delve into proof techniques and multi-bit frameworks.
Non-malleable Randomness Encoders and Their Applications
Explore non-malleable randomness encoders and their applications in cryptography, presented at Eurocrypt 2018 by leading researchers in the field.