Leftover Hash Lemma, Revisited
Explores improvements to the Leftover Hash Lemma, reducing entropy loss and seed length in cryptographic key derivation. Discusses the expand-then-extract approach and its security implications.
Deploying Complex Cryptography - Removing the Friction
Explore advanced cryptography deployment techniques to streamline implementation and enhance security with insights from Dr Michael Scott of MIRACL.
Tutorial on Homomorphic Encryption
Explore advanced homomorphic encryption concepts, including LWE, BV'11b construction, dimension reduction, and leveled FHE, building on fundamental knowledge from part 1.
Tutorial on Homomorphic Encryption
Explore homomorphic encryption fundamentals, including computing on encrypted data, Gentry's blueprint, and advanced concepts like bootstrapping and chimeric HE.
Functional Encryption for Inner Product: Achieving Const
Explore advanced cryptography concepts with a focus on functional encryption for inner product, achieving constant-size ciphertexts in prime-order groups.
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Explore efficient public-key encryption based on Computational Diffie-Hellman, presented at PKC 2010. Learn about advancements in cryptographic techniques and their implications for secure communication.
On the Feasibility of Consistent Computations
Explore the feasibility of consistent computations in cryptography, covering privacy, two-party security models, and complaint handling, with insights on construction and simulation.
Efficient Set Operations in the Presence of Malicious Adversaries
Explore efficient set operations with malicious adversaries, focusing on cryptographic techniques for secure multi-party computation and privacy-preserving data analysis.
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
Explore techniques to accelerate solving the discrete logarithm problem using equivalence classes, including fast inversion, distinguishing points, and random walks.
Security of Encryption Schemes in Weakened Random Oracle Models
Explore encryption scheme security in weakened random oracle models, examining vulnerabilities and implications for cryptographic systems.
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
Explore efficient squaring techniques in cyclotomic subgroups of sixth degree extensions, with applications to pairing-based cryptography and advantages of using twists.
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Explore advanced cryptographic techniques for fully homomorphic encryption, focusing on optimizing key and ciphertext sizes for improved efficiency and practicality.
Algebraic Cryptanalysis of the PKC 2009 Algebraic Surface Cryptosystem
Explore algebraic cryptanalysis techniques applied to the PKC'2009 Algebraic Surface Cryptosystem in this concise presentation by Faugère and Spaenlehauer.
Faster Pairing Computations on Curves with High-Degree Twists
Explore faster pairing computations on curves with high-degree twists, focusing on techniques like Miller's Algorithm and sexy twists to enhance cryptographic efficiency.
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
Explore techniques for maximizing small root bounds through linearization, with applications to enhancing security in RSA cryptosystems using small secret exponents.
Text Search Protocols with Simulation Based Security
Explore text search protocols with simulation-based security, covering applications, automata encryption, and evaluation techniques for secure and efficient data retrieval.
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
Explore cryptographic techniques for achieving chosen-ciphertext security using slightly lossy trapdoor functions, as presented by researchers Petros Mol and Scott Yilek at PKC 2010.
Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
Explore advanced cryptographic concepts: concurrent non-malleable statistically binding commitments and decommitments in constant rounds, presented by experts at PKC 2010.
Duality in Lattice Based Cryptography
Explore lattice-based cryptography's duality, focusing on public key generation and the GBV crypto system, with insights from expert Daniele Micciancio.
Identity-Based Aggregate and Multi-Signature Schemes Based on RSA
Explore identity-based aggregate and multi-signature schemes using RSA, covering applications, technical aspects, and proofs of knowledge in cryptography.
Position-Based Quantum Cryptography: Impossibility and Constructions
Explore quantum cryptography's position-based aspects, including impossibility results and potential constructions. Delve into secret communication, verification challenges, and quantum concepts.