The Price of Low Communication in Secure Multi-Party Computation
Explore the impact of limited communication in secure multi-party computation, examining adversarial models, corruption types, and their implications for protocol design and security.
The First Collision for Full SHA-1
Explore the groundbreaking research on SHA-1 collisions, including compression techniques, GPU acceleration, and reusable collision methods for cryptographic security.
Stronger Security for Reusable Garbled Circuits - General Definitions and Attacks
Explore advanced cryptographic concepts: reusable garbled circuits, enhanced security definitions, and potential attack vectors in this cutting-edge research presentation.
Prospects for a Quantum Factoring Machine
Explore quantum computing's potential for factoring, error correction, and cryptography impacts. Insights on qubit operations, Shor's algorithm, and quantum supremacy goals.
Message Franking via Committing Authenticated Encryption
Explore innovative cryptographic techniques for secure messaging, focusing on message franking and committing authenticated encryption.
Middle Product Learning With Errors
Explore the cryptographic concept of Middle Product Learning With Errors, its applications, and implications for secure communication systems.
Private Multiplication over Finite Fields
Explore secure multiparty computation techniques for private multiplication in finite fields, focusing on cryptographic protocols and their applications.
Proving Resistance against Invariant Attacks - How to Choose the Round Constants
Explore techniques for selecting round constants to enhance cryptographic resistance against invariant attacks, as presented in a research paper at Crypto 2017.
New Security Notions and Feasibility Results for Authentication of Quantum Data
Explores novel security concepts and potential applications for authenticating quantum data, advancing the field of quantum cryptography.
Quantum Non Malleability and Authentication
Explore quantum non-malleability and authentication, examining new definitions, properties, and challenges in cryptography.
Non Malleable Codes for Space Bounded Tampering
Explore non-malleable codes for space-bounded tampering, including tampering classes, leakage, and proof techniques. Gain insights into cryptographic security against adversarial modifications.
Robust Non Interactive Multiparty Computation Against Constant Size Collusion
Explore advanced cryptographic techniques for secure multiparty computation, focusing on robustness against constant-size collusion in non-interactive settings.
Quantum Security of NMAC and Related Constructions
Explore quantum security implications for cryptographic constructions like NMAC, Cascade, and GCM. Analyze PRF security in the post-quantum era.
Optimal Security Reductions for Unique Signatures - Bypassing Impossibilities with A Counterexample
Explores innovative techniques to bypass limitations in security reductions for unique signatures, presenting a counterexample that challenges existing impossibility results in cryptography.
Ouroboros - A Provably Secure Proof of Stake Protocol
Explore Ouroboros, a groundbreaking proof-of-stake blockchain protocol, examining its design, security features, and innovative solutions to key challenges in distributed ledger technology.
Memory Tight Reductions
Explore cryptographic reductions with minimal memory usage, examining techniques for efficient security proofs in resource-constrained environments.
LPN Decoded
Explore the cryptographic LPN problem and its decoding techniques in this research presentation from Crypto 2017, offering insights for cryptography enthusiasts.
Lower Bounds on Obfuscation from All or Nothing Encryption
Explores lower bounds on obfuscation using all-or-nothing encryption, discussing assumptions, black-box constructions, and key ideas in cryptography and secure computation.
Laconic Oblivious Transfer and its Applications
Explore laconic oblivious transfer, a cryptographic primitive, and its applications in secure computation protocols, presented at Crypto 2017 conference.
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security
Explores the gap between standard and ideal security models for tweakable blockciphers, presenting findings on their insuperability in cryptographic research.
Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization
Explore advanced cryptographic techniques for Turing machines, focusing on indistinguishability obfuscation with constant overhead and amortization methods.