Design in Type I, Run in Type III - Fast and Scalable Bilinear Type Conversion Using Integer Programm
Explore fast and scalable bilinear type conversion techniques using integer programming, focusing on designing in Type I and running in Type III for improved efficiency.
Efficient Algorithms for Supersingular Isogeny Diffie Hellman
Explore advanced cryptographic techniques with efficient algorithms for supersingular isogeny Diffie-Hellman, enhancing post-quantum cryptography knowledge.
Efficiently Computing Data Independent Memory Hard Functions
Explore efficient computation of data-independent memory hard functions, covering complexity, attacks, and practical applications in cryptography and security.
Encryption Switching Protocols
Explore homomorphic encryption, its variants, and the concept of encryption switching protocols in this cryptography-focused presentation.
EWCDM - An Efficient, Beyond Birthday Secure, Nonce Misuse Resistant MAC
Explore an advanced MAC algorithm offering enhanced security, efficiency, and resistance to nonce misuse attacks in cryptographic systems.
Extended Tower Number Field Sieve - A New Complexity for the Medium Prime Case
Explore an advanced cryptographic algorithm for factoring medium-sized prime numbers, offering insights into its complexity and potential applications in number theory and cryptography.
Fine Grained Cryptography
Explore advanced concepts in cryptography, focusing on fine-grained techniques and their applications in modern security systems.
How to Prove Knowledge of Small Secrets
Learn techniques for proving knowledge of small secrets, including homomorphic one-way functions and Sigma protocols, with applications in cryptography and secure communication.
Network Oblivious Transfer
Explore network oblivious transfer protocols, including models, security aspects, and efficiency considerations in cryptographic applications.
Obfuscation Combiners
Explore obfuscation combiners in cryptography, covering commercial schemes, theory, and various combiner types. Learn about structural and detecting combiners, and their limitations.
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Explore advanced cryptographic techniques like obfuscation and witness encryption, focusing on boosting correctness and combining security for enhanced data protection and privacy.
TWORAM - Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
Explore efficient oblivious RAM techniques, their applications in searchable encryption, and advancements in non-interactive ORAM, focusing on the TWORAM algorithm and its impact on adaptive computation.
Two Message Oblivious Evaluation of Cryptographic Functionalities
Explore secure two-message protocols for oblivious evaluation of cryptographic functions, enhancing privacy and efficiency in multi-party computations.
Separate Separations of CPA and Circular Security for Any Cycle Length
Explores circular insecurity in cryptography, focusing on cycle lengths in (Ring-)LWE. Covers applications, constructions, and separation techniques for enhancing cryptographic security.
Semantic Security and Indistinguishability in the Quantum World
Explore quantum-resistant cryptography, focusing on semantic security and indistinguishability concepts in the context of quantum computing advancements.
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Explore the cryptographic challenges in finding Nash Equilibrium, examining recent developments and implications for game theory and computational complexity.
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.
Quantum Homomorphic Encryption for Polynomial Sized Circuits
Learn about quantum homomorphic encryption for polynomial-sized circuits, covering key concepts, challenges, and innovative solutions in this cutting-edge cryptographic field.
Programmable Hash Functions from Lattices
Explore lattice-based cryptography and its applications in programmable hash functions, a key component in modern cryptographic systems.
Probabilistic Termination and Composability of Cryptographic Protocols
Explore probabilistic termination and composability in cryptographic protocols, focusing on Byzantine Agreement and broadcast protocols, synchronous functionalities, and composition theorems.
On the Relationship between Statistical Zero Knowledge and Statistical Randomized Encodings
Explore the connection between statistical zero knowledge and randomized encodings in cryptography, examining their similarities and differences.