Encrypt or Decrypt to Make a Single Key Beyond Birthday Secure Nonce Based MAC
Explore a cryptographic technique for creating a secure nonce-based MAC using a single key, offering beyond-birthday security through encryption or decryption methods.
Fast Correlation Attack Revisited
Explore advancements in cryptanalysis techniques, focusing on fast correlation attacks and their implications for stream cipher security.
Generic Attacks Against Beyond Birthday Bound MACs
Explore advanced cryptographic techniques for attacking message authentication codes beyond the birthday bound, enhancing understanding of security vulnerabilities.
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
Explore an optimal distributed discrete log protocol and its applications to homomorphic secret sharing in cryptography.
Practical and Tightly Secure Digital Signatures and Authenticated Key Exchange
Explore secure digital signatures and authenticated key exchange protocols, focusing on practical implementations and tight security proofs for real-world cryptographic applications.
Structured Encryption and Leakage Suppression
Explore advanced techniques in structured encryption and leakage suppression, focusing on enhancing data security and privacy in cryptographic systems.
Amortized Complexity of Information Theoretically Secure MPC Revisited
Explore advancements in secure multi-party computation, focusing on amortized complexity and information-theoretic security in distributed systems.
Simplifying Game Based Definitions
Explore innovative approaches to simplify game-based security definitions in cryptography, enhancing clarity and accessibility for researchers and practitioners.
Quantum FHE Almost As Secure As Classical
Explore groundbreaking research on quantum fully homomorphic encryption, comparing its security to classical methods and discussing potential implications for cryptography.
Rasta - A Cipher with Low ANDdepth and Few ANDs per Bit
Explore a novel cipher design with low AND-depth and minimal AND operations per bit, optimized for efficient implementation in various cryptographic applications.
Towards Bidirectional Ratcheted Key Exchange
Explore innovative cryptographic techniques for secure messaging, focusing on bidirectional ratcheted key exchange and its implications for modern communication systems.
Optimizing Authenticated Garbling for Faster Secure Two Party Computation
Explores advanced techniques for enhancing authenticated garbling, leading to faster and more efficient secure two-party computation protocols in cryptography.
Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models
Explore non-uniform bounds in cryptographic models, examining their implications for security proofs and practical applications in modern cryptography.
Limits on the Power of Garbling Techniques for Public Key Encryption
Explores limitations of garbling techniques in public key encryption, examining their effectiveness and potential constraints in cryptographic applications.
SPDZ2k - Efficient MPC mod 2^k for Dishonest Majority
Efficient multiparty computation protocol for dishonest majority settings, operating modulo 2^k. Presents novel techniques for secure computation with improved efficiency.
Continuously Non Malleable Codes in the Split State Model from Minimal Assumptions
Explore advanced cryptographic techniques for secure data encoding, focusing on non-malleable codes in split-state models and their applications in information security.
Private Circuits - A Modular Approach
Explore modular approaches to private circuits, focusing on cryptographic techniques for secure computation and data protection in various applications.
Non Malleable Codes for Partial Functions with Manipulation Detection
Explore non-malleable codes for partial functions, their applications, and construction methods. Learn about challenges, admissible function classes, and implementations in various models.
TinyKeys - A New Approach to Efficient Multi-Party Computation
Explore a novel approach to efficient multi-party computation with TinyKeys, focusing on protocol complexity, OT extension, and secure protocols for improved performance.
On the Complexity of Compressing Obfuscation
Explore the complexity of compressing obfuscation, focusing on indistinguishability obfuscation, compression hierarchy, and statistically secure compressing obfuscation in cryptography.
Pseudorandom Quantum States
Explore pseudorandom quantum states, their definitions, applications in quantum money, and related concepts like pseudorandom unitary operators in this cryptography research presentation.