Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
Explore lattice-based cryptography: signature schemes with efficient protocols and dynamic group signatures. Learn about cutting-edge research in post-quantum cryptographic techniques.
Nonlinear Invariant Attack – Practical Attack on Full SCREAM, iSCREAM, and Midori64
Explore practical nonlinear invariant attacks on cryptographic algorithms SCREAM, iSCREAM, and Midori64, presented by experts at Asiacrypt 2016.
Advances in Functional Encryption
Explore cutting-edge developments in functional encryption with cryptography expert Hoeteck Wee, covering recent advancements and potential applications in data security.
Authenticated Encryption with Variable Stretch
Explore authenticated encryption with variable stretch, covering nonce misuse, counterintuitive behavior, and security experiments. Gain insights into this cryptographic technique.
Statistical Fault Attacks on Nonce Based Authenticated Encryption Schemes
Explore statistical fault attacks on nonce-based authenticated encryption schemes, examining vulnerabilities and potential countermeasures in cryptographic systems.
Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm
Cryptographic analysis of ELmD algorithm, exploring vulnerabilities in its authenticated encryption scheme through universal forgery and key recovery attacks.
Trick or Tweak - On the Insecurity of OTR’s Tweaks
Cryptographic analysis of OTR protocol tweaks, revealing potential vulnerabilities and security implications for secure messaging systems.
How to Generate and Use Universal Samplers
Generate and utilize universal samplers for cryptographic applications, exploring techniques presented at Asiacrypt 2016 by leading researchers in the field.
Cliptography - Clipping the Power of Kleptographic Attacks
Explore kleptographic attacks and defenses in cryptography, focusing on the cliptographic model for mitigating subliminal channel vulnerabilities in cryptographic implementations.
Cryptography in Vietnam in the French and American Wars
Explore Vietnam's cryptographic history during French and American conflicts, examining codebreaking techniques and their impact on warfare outcomes.
Simpira v2 - A Family of Efficient Permutations Using the AES Round Function
Explore efficient permutations using AES round function, including background, limitations, requirements, attacks, and benchmarks for cryptographic applications.
Towards Practical Whitebox Cryptography - Optimizing Efficiency and Space Hardness
Explore optimized whitebox cryptography techniques, focusing on efficiency and space hardness for enhanced practical applications in secure systems.
Efficient and Provable White Box Primitives
Explore efficient white-box cryptography primitives, focusing on incompressibility, security models, and the Coureur DesBois family. Learn about implementation strategies and performance comparisons.
MiMC - Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Explore efficient encryption and cryptographic hashing techniques with minimal multiplicative complexity, enhancing security in resource-constrained environments.
Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks
Explore a memory-hard function that offers proven defense against sequential attacks, enhancing cryptographic security and computational resilience.
Linear Structures - Applications to Cryptanalysis of Round Reduced Keccak
Explore cryptanalysis techniques for round-reduced Keccak, focusing on linear structures and their applications in breaking this widely-used hash function.
When Are Fuzzy Extractors Possible
Explore the feasibility and limitations of fuzzy extractors in cryptography, examining their potential applications and theoretical foundations.
The Reality of Cryptographic Deployments on the Internet
Explore cryptographic deployments on the Internet, focusing on Diffie-Hellman key exchange, implementation flaws, policy impacts, and lessons for better security practices.
Faster Fully Homomorphic Encryption - Bootstrapping in Less Than 0.1 Seconds
Explore advancements in fully homomorphic encryption, focusing on accelerated bootstrapping techniques and their impact on cryptographic efficiency and security.
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.
On the Security of Supersingular Isogeny Cryptosystems
Explore the security aspects of supersingular isogeny cryptosystems, examining potential vulnerabilities and cryptographic implications in this advanced mathematical discussion.