Garbled Circuits - Eurocrypt 2024
Explore cutting-edge cryptographic techniques and advancements in garbled circuits at this Eurocrypt 2024 session, chaired by Peter Scholl.
Secure Outsourcing
Explore cutting-edge research on secure data outsourcing techniques presented at Eurocrypt 2024, focusing on cryptographic solutions for privacy and integrity in cloud computing.
Secure Multi-Party Computation
Explore cutting-edge research in secure multi-party computation at Eurocrypt 2024, featuring presentations on advanced cryptographic protocols and collaborative data analysis techniques.
Don't Eject the Impostor: Fast Three-Party Computation with a Known Cheater
Explore fast three-party computation techniques with a known cheater, enhancing security and efficiency in multi-party protocols.
Cryptographically Secure Data Analysis for Social Good
Secure multi-party computation enables analysis of sensitive salary data to calculate pay disparities while maintaining confidentiality, demonstrating potential for social impact in privacy-constrained contexts.
Correlated Pseudorandom Functions from Variable-Density LPN
Explore correlated pseudorandom functions and variable-density LPN, delving into weak PRFs, secure multi-party computation, and pseudorandom correlation generators for enhanced cryptographic security.
Laconic Conditional Disclosure of Secrets and Applications
Explore innovative cryptographic techniques for secure information sharing, including probabilistically checkable proofs and garbled circuits, with applications in malicious laconic oblivious transfer.
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.
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.
On the Power of Secure Two Party Computation
Explore secure two-party computation, zero-knowledge proofs, and MPC protocols. Learn about garbled circuits and their applications in cryptography and privacy-preserving technologies.
Faster Secure Two Party Computation in the Single Execution Setting
Explore advanced techniques for faster and more secure two-party computation, focusing on single execution settings and improvements to existing protocols.
The Price of Low Communication in Secure Multi-Party Computation
Explore the impact of limited communication in secure multi-party computation, examining adversarial models, corruption types, and their implications for protocol design and security.
Stronger Security for Reusable Garbled Circuits - General Definitions and Attacks
Explore advanced cryptographic concepts: reusable garbled circuits, enhanced security definitions, and potential attack vectors in this cutting-edge research presentation.
Identity Based Encryption from the Diffie Hellman Assumption
Explore identity-based encryption, chameleon hashing, and garbled circuits in cryptography. Learn about innovative techniques and their applications in secure communication systems.
K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
Explore advanced cryptographic techniques for secure multiparty computation, focusing on k-round protocols and their relationship to oblivious transfer and garbled interactive circuits.
Two-Round Multiparty Secure Computation from Minimal Assumptions
Explore minimal assumptions for two-round multiparty secure computation, covering protocol design, garbled circuits, and oblivious transfer in cryptographic applications.
Adaptively Secure Garbling with Near Optimal Online Complexity
Learn about adaptively secure garbling schemes with near-optimal online complexity, exploring key concepts, techniques, and their significance in cryptography and secure computation.
Non Interactive Zero Knowledge Proofs for Composite Statements
Explore advanced zero-knowledge proofs for composite statements, covering Sigma protocols, garbled circuits, and SNARK constructions. Learn about privacy-preserving credentials and RSA signatures.
Secure Computation II
Explore advanced secure computation concepts, including information theory, MPC, ground complexity, fairness, and breakthrough results in cryptography.
SecretFlow-SPU - A Performant and User-Friendly Framework for Privacy-Preserving Machine Learning
Explore SecretFlow-SPU, a framework for privacy-preserving machine learning that outperforms existing solutions and simplifies development for users without cryptography expertise.