Rate 1 - Linear Time and Additively Homomorphic UC Commitments
Explore universal composability, homomorphism, and rate in commitment schemes. Learn about theoretical results, building blocks, and practical applications in cryptography.
Cryptographic Applications of Capacity Theory - On the Optimality of Coppersmith's Method
Explore cryptographic applications of capacity theory, focusing on Coppersmith's Method optimality. Covers auxiliary polynomials, Minkowski theorem, and Cantor-Bromley capacity theory.
The Reality of Cryptographic Deployments on the Internet
Explore cryptographic deployments on the Internet, focusing on Diffie-Hellman key exchange, implementation flaws, policy impacts, and lessons for better security practices.
Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
Explore advanced cryptographic techniques for secure public key encryption, focusing on efficient KDM CCA security for polynomial functions.
Computational Integrity with a Public Random String from Quasi Linear PCPs
Explore computational integrity using quasi-linear PCPs and public randomness. Learn about protocol design, low-degree testing, and cryptographic assumptions in this advanced cryptography talk.
Fixing Cracks in the Concrete Random Oracles with Auxiliary Input, Revisited
Explore cryptographic techniques for strengthening random oracle models against auxiliary input attacks, enhancing security in various cryptographic applications.
Depth Robust Graphs and Their Cumulative Memory Complexity
Explore depth robust graphs and their cumulative memory complexity, examining theoretical foundations and practical implications for cryptographic applications.
One Shot Verifiable Encryption from Lattices
Explore lattice-based cryptography with a focus on one-shot verifiable encryption, covering zero-knowledge proofs, Ring-LWE encryption, and practical applications in this cutting-edge research presentation.
A Kilobit Hidden SNFS Discrete Logarithm Computation
Explore the computation of discrete logarithms using SNFS, discussing its implications for cryptography and digital signatures, with a focus on prime selection and security considerations.
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree
Explore advanced cryptographic constructions including projective arithmetic functional encryption and indistinguishability obfuscation, with insights on efficiency and future research directions.
Topology Hiding Computation on All Graphs
Explore topology hiding computation on all graphs, covering security, broadcast results, protocols, and semantic security. Discover contributions and open questions in this cryptographic field.
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.
Private Multiplication over Finite Fields
Explore secure multiparty computation techniques for private multiplication in finite fields, focusing on cryptographic protocols and their applications.
Combinatorics in Information Theoretic Cryptography
Explore the intersection of combinatorics and information-theoretic cryptography in this invited talk by Huaxiong Wang at Asiacrypt 2017, delving into advanced mathematical concepts.
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.
Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
Explores advanced cryptanalysis techniques, focusing on enhanced division property-based cube attacks and leveraging algebraic properties of superpoly to improve cryptographic analysis.
Faster Homomorphic Linear Transformations in HElib
Explore advanced techniques for optimizing homomorphic linear transformations in HElib, enhancing efficiency in encrypted computations.
Out of Band Authentication in Group Messaging - Computational, Statistical, Optimal
Explore secure group messaging protocols, focusing on out-of-band authentication methods to prevent man-in-the-middle attacks and enhance end-to-end encryption in multi-user settings.
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.
Differential Privacy and the People's Data
Explore differential privacy mechanisms, applications, and challenges in data protection. Insights from Cynthia Dwork on privacy-preserving techniques, real-world implementations, and future directions.
Mathematics and Cryptography - A Marriage of Convenience?
Explore the interplay between mathematics and cryptography, covering key concepts, historical developments, and personal insights from a renowned cryptographer's journey in the field.