Garbling Gadgets for Boolean and Arithmetic Circuits
Explore innovative garbling techniques for Boolean and arithmetic circuits, enhancing cryptographic protocols and secure computation methods.
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Optimizing secure multiparty computation for internet use, focusing on efficiency improvements in BMR protocol and OT-based methods for honest-minority settings.
Alternative Implementations of Secure Real Numbers
Explore alternative implementations of secure real numbers, including golden section numbers and logarithmic floats, with benchmarks for various operations in secure computation outsourcing.
Practical Detection of Entropy Loss in Pseudo-Random Number Generators
Explore techniques for detecting entropy loss in pseudo-random number generators, crucial for cryptographic security. Learn analysis procedures and implementation strategies.
On the Practical - In-Security of 64-bit Block Ciphers - Collision Attacks on HTTP over TLS and OpenVPN
Explore practical security vulnerabilities in 64-bit block ciphers, focusing on collision attacks in HTTP over TLS and OpenVPN. Learn about countermeasures and implications for network security.
Message-Recovery Attacks on Feistel-Based Format Preserving Encryption
Explore message-recovery attacks on Feistel-based format preserving encryption, examining technical challenges, known plaintext attacks, and theoretical implications for cryptographic security.
A Systematic Analysis of the Juniper Dual EC Incident
Systematic analysis of Juniper's Dual EC cryptographic incident, exploring vulnerabilities, attack methods, and implications for network security and encryption standards.
MPC-Friendly Symmetric Key Primitives
Explore MPC-friendly symmetric key primitives for secure computation, focusing on PRFs, secure sharing, and efficient preprocessing techniques in cryptography.
Strong Non-Interference and Type-Directed Higher-Order Masking
Explore differential power analysis, masking techniques, and strong non-interference in cryptographic systems. Learn about probing security and noiseless leakage models.
When Ransomware Strikes
Explore ransomware threats, prevention strategies, and recovery methods with expert insights on protecting your company's data and responding to attacks.
Personal Privacy vs National Security
Debate exploring the tension between individual privacy rights and national security needs, discussing encryption, law enforcement, and government access to communications.
Indistinguishability Obfuscation from Well Founded Assumptions - Part 1
Explore the concept of indistinguishability obfuscation, its historical perspective, and related topics like pseudorandom objects and learning with errors in computer science.
Indistinguishability Obfuscation from Well Founded Assumptions - Part 3
Explore advanced cryptographic concepts like indistinguishability obfuscation, learning parity with noise, and structured seed PRGs. Delve into degree-2.5 integer PRGs and their applications in cryptography.
Local Proofs Approaching the Witness Length
Explore probabilistically checkable proofs, interactive oracle proofs, and tensor codes in this talk on local proofs and witness length optimization.
Is it Easier to Prove Statements that are Guaranteed to be True?
Explore the intricacies of proving statements in computational complexity, focusing on worst-case vs. average-case hardness and the challenges in NP-Search problems.
Extractors and Secret Sharing Against Bounded Collusion Protocols
Explore complexity theory, multiparty communication, and leakage-resilient extractors in this talk on bounded collusion protocols and secret sharing techniques.
Nearly Optimal Pseudorandomness From Hardness
Explore cutting-edge pseudorandomness techniques derived from computational hardness, focusing on novel approaches using codes with large alphabets and pseudoentropy extraction.
Kernel Density Estimation through Density Constrained Near Neighbor Search
Explore kernel density estimation through near neighbor search, focusing on importance sampling, locality sensitive hashing, and data-dependent techniques for improved efficiency and accuracy.
A Constant Rate Non-Malleable Code in the Split-State Model
Explore constant rate non-malleable codes in the split-state model, examining construction, scenarios, and checks for this cryptographic technique.
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency
Explores round complexity in perfect multi-party computation, focusing on active security and optimal resiliency. Discusses recent developments, protocol folding, and impossibility results.
Get Started with Discovering, Protecting, and Governing Sensitive Data
Discover, protect, and govern sensitive data across your organization with Microsoft Purview. Learn about automated classifiers, encryption, and secure collaboration for comprehensive data management.