How to Circumvent the Two Ciphertext Lower Bound for Linear Garbling Schemes
Explores innovative techniques to overcome limitations in linear garbling schemes, focusing on circumventing the two-ciphertext lower bound for improved efficiency in secure computation protocols.
Constant Round Asynchronous Multi Party Computation Based on One Way Functions
Explore constant-round asynchronous multi-party computation protocols using one-way functions, enhancing secure distributed computing in asynchronous networks.
Optimization of LPN Solving Algorithms
Explore optimization techniques for LPN solving algorithms, including sparse secret, claw reduce, drop reduce, and code reduce methods. Learn about their applications and effectiveness.
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.
Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity
Explore advanced cryptographic techniques for efficient and secure searchable encryption, focusing on worst-case sub-linear complexity and innovative data structures.
Scrypt is Maximally Memory Hard
Explore the memory-hardness of Scrypt, a cryptographic function, through an in-depth analysis of its time complexity, technical barriers, and strategic implications.
A Note on Perfect Correctness by Derandomization
Explore derandomization techniques for achieving perfect correctness in cryptographic schemes, focusing on public-key encryption and the concept of cryptographic strings.
Sublinear Zero Knowledge Arguments for RAM Programs
Explore cutting-edge cryptographic techniques for efficient zero-knowledge proofs in RAM programs, enhancing privacy and security in computational systems.
Time Memory Tradeoff Attacks on the MTP Proof of Work Scheme
Explore time-memory tradeoff attacks on MTP proof of work, covering memory-hard functions, Merkle hash trees, and computational complexity in blockchain security.
Towards a Classification of Non-Interactive Computational Assumptions in Cyclic Groups
Explore non-interactive computational assumptions in cyclic groups, covering families, variants, and hierarchies. Gain insights into cryptographic foundations and their classifications.
Coded BKW with Sieving
Explore an innovative approach to solving the Learning with Errors problem using coded BKW with sieving, presented at Asiacrypt 2017.
Revisiting the Expected Cost of Solving uSVP and Applications to LWE
Explores the expected cost of solving unique Shortest Vector Problem (uSVP) and its applications to Learning with Errors (LWE), providing insights for cryptographic security assessments.
The Iterated Random Function Problem
Explore the Iterated Random Function Problem, including adaptive collision fighting attacks, random functions, and permutation cycles in cryptography.
Faster Algorithms for Isogeny Problems Using Torsion Point Images
Explore advanced cryptographic techniques using torsion point images to accelerate algorithms for isogeny problems, enhancing efficiency in post-quantum cryptography.
Grover Meets Simon - Quantumly Attacking the FX Construction
Explore quantum attacks on the FX construction, combining Grover's and Simon's algorithms for cryptanalysis in this advanced cryptography presentation.
Cycle Slicer - An Algorithm for Building Permutations on Special Domains
Explore an innovative algorithm for constructing permutations on specific domains, enhancing cryptographic techniques and computational efficiency.
Lower Bounds on Lattice Enumeration with Extreme Pruning
Explore advanced techniques in lattice-based cryptography, focusing on lower bounds for enumeration algorithms with extreme pruning to enhance security analysis.
Deep Learning to Evaluate Secure RSA Implementations
Explore deep learning techniques for evaluating secure RSA implementations, focusing on cryptographic hardware and embedded systems security.
Low Error Efficient Computational Extractors in the CRS Model
Explore efficient computational extractors with low error in the CRS model, covering weak sources, two-source extractors, and non-malleable extractors. Gain insights into cutting-edge cryptographic research.
Public Key Cryptography II
Explore decentralized storage, hierarchical identity-based encryption, and adaptive CPA security. Delve into bounded HIBE, security loss, and open questions in cryptography.
Complexity and Experience in Design
Explore the relationship between complexity and experience in design, discussing reasonable rates of change and strategies for better personal attitudes and working habits.