Secure Stable Matching at Scale
Explore secure stable matching algorithms for large-scale applications, focusing on privacy preservation and efficient computation in scenarios like medical residency matching.
GAZELLE - A Low Latency Framework for Secure Neural Network Inference
Efficient framework for secure neural network inference combining homomorphic encryption and two-party computation, outperforming existing systems in speed while preserving privacy for cloud-based machine learning.
MAGE - Nearly Zero-Cost Virtual Memory for Secure Computation
MAGE: An execution engine for secure computation, enabling efficient processing of large-scale encrypted data by leveraging oblivious memory access patterns to optimize virtual memory management.
Revisiting Square Root ORAM - Efficient Random Access in Multi-Party Computation
Explores modifications to square-root ORAM for efficient random access in multi-party computation, offering significant performance improvements over existing approaches for various applications.
SoK - Cryptographic Neural-Network Computation
Explore cryptographic techniques for secure neural network computation, focusing on privacy-preserving methods and their applications in machine learning.
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Explore high-throughput secure three-party computation with an honest majority in this presentation on advanced cryptographic protocols and their practical applications.
Amortizing Secure Computation with Penalties
Explore secure computation with penalties, focusing on amortization techniques to enhance efficiency in cryptographic protocols for multi-party computations.
Improvements to Secure Computation
Explore advancements in secure computation techniques, focusing on enhanced privacy and efficiency in multi-party protocols presented at the ACM CCS 2016 conference.
ObliVM - A Programming Framework for Secure Computation
Explore ObliVM, a framework for secure computation offering a domain-specific language, user-friendly abstractions, and efficient oblivious representations for various applications like data mining and genomic analysis.
Duoram - A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation
Innovative distributed ORAM protocol for secure computation, offering significant bandwidth efficiency and performance improvements through novel vector dot product evaluation techniques.
Collusion-Preserving Computation
Explore collusion-preserving computation, its definition, related work, criticism, security aspects, and applications in game theory.
Non-Interactive Secure Multiparty Computation
Explore non-interactive secure multiparty computation, covering basic concepts, extensions, and applications. Learn about multi-input functional encryption and fully-robust NIMPC for various functions.
How to Use Bitcoin to Design Fair Protocols
Learn to design fair protocols using Bitcoin, exploring concepts like fair exchange, claim-or-refund functionality, and secure computation with penalties in this cryptography-focused talk.
Leakage-Tolerant Computation with Input-Independent Preprocessing
Explore leakage-tolerant computation techniques with input-independent preprocessing, focusing on multi-party computation models and innovative encoding methods for enhanced security.
Concurrent Secure Computation with Optimal Query Complexity
Explore concurrent secure computation, focusing on optimal query complexity, circumventing impossibility results, and improving simulation techniques in cryptographic protocols.
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
Learn efficient techniques for secure multi-party computation, combining BMR and SPDZ approaches to achieve constant-round protocols with improved performance and security guarantees.
Secure Computation with Minimal Interaction, Revisited
Explore advanced techniques for secure computation with minimal interaction, revisiting key concepts and presenting new insights in cryptography and data privacy.
Efficient Multi Party Computation - From Passive to Active Security via Secure SIMD Circuits
Explore advanced techniques in multi-party computation, focusing on the transition from passive to active security through secure SIMD circuits.
Large Scale Secure Computation - Multi Party Computation for Parallel RAM Programs
Explore secure multi-party computation techniques for parallel RAM programs, focusing on large-scale applications and advanced cryptographic protocols.
Incoercible Multi Party Computation and Universally Composable Receipt Free Voting
Explore incoercible multi-party computation and its application in creating universally composable, receipt-free voting systems for enhanced election integrity.
Secure Computation from Leaky Correlated Randomness
Explore advanced cryptographic techniques for secure computation using leaky correlated randomness, enhancing privacy and security in distributed systems.