Post Quantum Cryptography for Dummies
Explore post-quantum cryptography, its impact on public key systems, quantum computing basics, and future-proofing strategies for cybersecurity in the quantum era.
Practical Crypto Review for Developers
Comprehensive review of practical cryptography for developers, covering essential concepts and implementation techniques for secure software development.
Rethinking Cybersecurity in the Quantum Age
Explore the impact of quantum computing on cybersecurity, discussing potential threats and necessary adaptations for future-proofing digital defenses in this thought-provoking presentation.
Fair Computation with Rational Players
Explore fair computation with rational players, focusing on two-party computation, game theory in cryptography, and strategies for achieving fairness in real-world and ideal-world scenarios.
Narrow-Bicliques - Cryptanalysis of Full IDEA
Explore cryptanalysis techniques for IDEA cipher, focusing on meet-in-the-middle attacks and narrow bicliques. Learn about advanced methods in symmetric cryptography.
Decoding Random Binary Linear Codes in 2 n/20 - How 1 + 1
Explore cutting-edge techniques for decoding random binary linear codes, presented by experts at Eurocrypt 2012. Learn about innovative approaches that push the boundaries of cryptography.
Fully Homomorphic Encryption with Polylog Overhead
Explore advanced cryptography techniques with a focus on Fully Homomorphic Encryption, discussing its implementation and potential for improved efficiency in secure data processing.
Tightly-Secure Signatures from Lossy Identification Schemes
Explore secure signature schemes derived from lossy identification, examining alternatives to Fiat-Shamir and discussing tight security in cryptographic protocols.
Adaptively Attribute-Hiding - Hierarchical Inner Product
Explore adaptive security and attribute-hiding in inner product encryption, covering key techniques, dual pairing vector spaces, and dual system encryption methodology.
Optimal Security Proofs for Full Domain Hash, Revisited
Explore optimal security proofs for RSA Full Domain Hash signatures, addressing flaws in previous work and presenting new results on lossiness and extensions to PSS.
A Tutorial on High Performance Computing Applied to Cryptanalysis
Learn high-performance computing techniques for cryptanalysis, covering key steps from concept to implementation, with insights on scaling computations and optimizing algorithms for cryptographic challenges.
Efficient and Optimally Secure Key-Length Extension for Block Ciphers
Explore efficient key-length extension techniques for block ciphers, focusing on cascading methods and generic attacks to enhance cryptographic security.
Trapdoors for Lattices - Simpler, Tighter, Faster, Smaller
Explore advanced cryptographic techniques for lattice-based trapdoors, offering improved simplicity, efficiency, and compactness in secure systems design.
Property Preserving Symmetric Encryption
Explore property preserving symmetric encryption, its security definitions, and constructions using pairings in composite order groups. Learn about new directions in this cryptographic field.
Unconditionally-Secure Robust Secret Sharing with Compact Shares
Explore unconditionally-secure robust secret sharing techniques, focusing on a new scheme with compact shares and efficient reconstruction for secure data storage applications.
Malleable Proof Systems and Applications
Explore malleable proof systems and their applications in cryptography, focusing on recent advancements and potential uses in secure protocols.
Another Look at Provable Security
Explore provable security, examining non-tight reductions, identity-based encryption, MACs in multi-user settings, and the implications for real-world cryptographic implementations.
Fully Homomorphic Encryption without Modulus Switching
Explore fully homomorphic encryption without modulus switching, covering outsourcing computation, FHE generations, scale-independent FHE, and bootstrapping for full homomorphism.
Quantum to Classical Randomness Extractors
Explore quantum and classical randomness extractors, their constructions, and applications in secure functionalization and quantum storage systems.
The Curious Case of Non-Interactive Commitments
Explore non-interactive commitments in cryptography, examining black-box constructions, hitting functions, and open questions in this advanced theoretical discussion.
Efficient Dissection of Composite Problems, with Applications
Explore advanced cryptographic techniques for dissecting composite problems, focusing on applications in cryptanalysis and algorithm optimization.