A General Polynomial Selection Method and New Asymptotic Complexities
Explore a novel polynomial selection technique and its impact on asymptotic complexities in cryptography, presented by experts at Asiacrypt 2016.
Living Between the Ideal and Real Worlds
Explore the balance between theoretical ideals and practical realities in cryptography with insights from expert Nigel Smart's Eurocrypt 2017 presentation.
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.
Lattice Based SNARGs and Their Application to More Efficient Obfuscation
Explore lattice-based SNARGs and their role in enhancing obfuscation efficiency. Learn about multilinear maps, bootstrapping, and linear PCPs in cryptography.
Public Seed Pseudorandom Permutations
Explore innovative cryptographic techniques for constructing public-seed pseudorandom permutations, enhancing security and efficiency in various applications.
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.
On the Exact Round Complexity of Self Composable Two Party Computation
Explore the round complexity of self-composable two-party computation, examining concurrent, consecutive, and XP security models, with insights on overall approach and technical aspects.
From Minicrypt to Obfustopia via Private Key Functional Encryption
Explore the cryptographic journey from Minicrypt to Obfustopia, delving into private key functional encryption and its implications for advanced security systems.
Memory Tight Reductions
Explore cryptographic reductions with minimal memory usage, examining techniques for efficient security proofs in resource-constrained environments.
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.
From Obfuscation to the Security of Fiat Shamir for Proofs
Explore the security of Fiat-Shamir for proofs, examining obfuscation, negative results, strong assumptions, and correlation intractable hash functions in cryptography.
Distinguisher Dependent Simulation in Two Rounds and Its Applications
Explore innovative cryptographic techniques for two-round distinguisher-dependent simulation and their practical applications in secure systems.
Generic Transformations of Predicate Encodings - Constructions and Applications
Explore generic transformations of predicate encodings, their constructions, and applications in cryptography. Gain insights into advanced cryptographic techniques and their implications.
Optimal Rate Non Committing Encryption
Explore cutting-edge cryptographic techniques for secure communication with optimal efficiency, presented by leading researchers at Asiacrypt 2017.
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.
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.
On the Exact Round Complexity of Secure Three Party Computation
Explore the precise round complexity of secure three-party computation protocols, examining theoretical advancements and practical implications in cryptography.
A Fine Grained Approach to Complexity
Explore a nuanced perspective on computational complexity, delving into fine-grained approaches and their implications for algorithm design and problem-solving.