Patchable Indistinguishability Obfuscation iO for Evolving Software
Explore indistinguishability obfuscation for evolving software, focusing on patchable techniques, multi-program applications, and cryptographic implications in this advanced cryptography presentation.
Removing the Strong RSA Assumption from Arguments over the Integers
Explore cryptographic techniques to eliminate the Strong RSA Assumption in integer-based arguments, enhancing security and efficiency in cryptographic protocols.
The Multi User Security of Double Encryption
Explore the cryptographic concept of double encryption and its implications for multi-user security in this research presentation from Eurocrypt 2017.
Quantum Secure Symmetric Key Cryptography Based on Hidden Shifts
Explore post-quantum cryptography, hidden shift problems, and secure symmetric key systems. Delve into Simons algorithm and coset sampling for advanced cryptographic insights.
Decentralized Anonymous Micropayments
Explore innovative blockchain-based micropayment systems that ensure user privacy and efficient transactions without intermediaries.
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.
New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
Explore a novel tool for impossible differential cryptanalysis, enhancing block cipher design and analysis. Learn about its applications, strengths, and implications for cryptographic security.
Public Seed Pseudorandom Permutations
Explore innovative cryptographic techniques for constructing public-seed pseudorandom permutations, enhancing security and efficiency in various applications.
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.
Separating Semantic and Circular Security for Symmetric Key Bit Encryption
Explore the distinction between semantic and circular security in symmetric key bit encryption, examining theoretical foundations and practical implications.
Cryptography with Updates
Explore cutting-edge research on cryptographic systems that can be securely updated, presented at Eurocrypt 2017. Delve into innovative approaches for maintaining security in evolving digital environments.
Fixing Cracks in the Concrete Random Oracles with Auxiliary Input, Revisited
Explore cryptographic techniques for strengthening random oracle models against auxiliary input attacks, enhancing security in various cryptographic applications.
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.
Depth Robust Graphs and Their Cumulative Memory Complexity
Explore depth robust graphs and their cumulative memory complexity, examining theoretical foundations and practical implications for cryptographic applications.
Toward Fine Grained Blackbox Separations Between Semantic and Circular Security Notions
Explores fine-grained blackbox separations between semantic and circular security notions in cryptography, discussing encryption, seed circular security, and fully blackbox constructions.
Group Based Secure Computation - Optimizing Rounds, Communication, and Computation
Explore optimizations for group-based secure computation, focusing on rounds, communication, and computation efficiency. Learn about homomorphic secret sharing and cryptographic frameworks.
On the Exact Round Complexity of Self Composable Two Party Computation
Explore the round complexity of self-composable two-party computation, examining concurrent, consecutive, and XP security models, with insights on overall approach and technical aspects.
Small CRT Exponent RSA Revisited
Explore advancements in cryptographic techniques for Small CRT Exponent RSA, examining potential vulnerabilities and proposed improvements in this critical area of cybersecurity.
Conditional Cube Attack on Reduced Round Keccak Sponge Function
Explore a novel cryptanalysis technique for the Keccak sponge function, examining its vulnerabilities and potential implications for cryptographic security.
On Dual Lattice Attacks Against Small Secret LWE and Parameter Choices in HElib and SEAL
Explore dual lattice attacks on small secret LWE and their implications for parameter selection in HElib and SEAL cryptographic libraries.
Functional Encryption - Deterministic to Randomized Functions from Simple Assumptions
Explore functional encryption algorithms, from deterministic to randomized functions, with examples and key concepts like correctness, hiding properties, and encryption algorithms.