Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
Explore advanced lattice-based cryptanalysis techniques, focusing on improved Progressive BKZ algorithms and precise cost estimation using a sharp simulator.
Fair and Robust MPC Using a Global Transaction Ledger
Explore secure function evaluation with fairness and robustness using a public transaction ledger, addressing challenges and presenting novel solutions for cryptographic protocols.
Indifferentiability of Confusion-Diffusion Networks
Explore indifferentiability in confusion-diffusion networks, examining combinatorial properties, RCR permutations, conductance, and domain extension in cryptography.
Two Round Multiparty Computation via Multi-key FHE
Explore advanced cryptographic techniques for secure multi-party computation using fully homomorphic encryption and learning with errors, with applications in distributed systems.
Computationally Binding Quantum Commitments
Explore quantum commitments, their computational binding properties, and new definitions needed in this field. Learn about collapsing hash functions and current open questions.
Circuit Compilers with O-1-log -n- Leakage Rate
Explore advanced cryptographic techniques for circuit compilers, focusing on achieving O(1/log(n)) leakage rate in secure computation and hardware protection.
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
Explore principal ideals in cyclotomic rings, focusing on short generator recovery techniques and their cryptographic implications. Gain insights from Oded Regev's expert analysis.
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
Explore advanced cryptographic techniques for constant-round leakage-resilient zero-knowledge proofs based on collision resistance, as presented at Eurocrypt 2015.
The Exact Round Complexity of Secure Computation
Explore the precise round complexity in secure computation, examining theoretical foundations and practical implications for cryptographic protocols.
Unconditionally Secure Computation with Reduced Interaction
Explore unconditionally secure computation techniques, focusing on reduced interaction and improved efficiency for complex functions in cryptographic protocols.
Anonymous Traitor Tracing - How to Embed Arbitrary Information in a Key
Explore techniques for embedding hidden information in cryptographic keys to trace unauthorized sharing, with applications in content protection and digital rights management.
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
Explore sequential memory-hard functions, cumulative memory complexity, and pebbling games in cryptography. Insights on password hashing and proofs of space in parallel random oracle models.
On the Size of Pairing-Based Non-interactive Arguments
Explore pairing-based non-interactive arguments, their size, and construction, with insights on lower bounds and comparisons in cryptography.
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Explore low-noise LPN-based pseudorandom functions in almost constant depth, covering LPN hardness, randomized PRGs, and noise extraction techniques.
Protecting TLS from Legacy Crypto
Explore TLS vulnerabilities, attacks on legacy crypto, and downgrade protection strategies. Learn about protocol agility, SIGMA, Logjam, SLOTH, and TLS 1.3's improved security features.
Provably Robust Sponge-Based PRNGs and KDFs
Explore robust sponge-based pseudorandom number generators and key derivation functions, examining their security properties and practical applications in cryptography.
Faster Algorithms for Solving LPN
Explore advanced techniques for solving the Learning Parity with Noise (LPN) problem, focusing on improved algorithms and their implications for cryptography.
Provably Weak Instances of Ring-LWE Revisited
Revisiting provably weak instances of Ring-LWE, exploring potential threats and solutions in cryptography, with focus on Learning With Errors and evaluation-at-1 attacks.
Tightly CCA-Secure Encryption Without Pairings
Explore advanced encryption techniques, focusing on CCA-secure methods without pairings. Learn about tight security, tag-based encryption, and innovative approaches to cryptographic constructions.
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
Explore advanced cryptographic concepts like indistinguishability obfuscation and graded encoding schemes, focusing on strengthening reductions and upgrading functional encryption techniques.
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
Explore optimal robust secret sharing techniques with maximal corruptions, focusing on advanced cryptographic concepts and their practical applications.