World-leaders in Cryptography - Phillip Rogaway
Dive into the groundbreaking work of cryptography pioneer Phillip Rogaway, exploring his contributions to random oracles, symmetric key modes, and ethical considerations in the field.
Fast Secure Computation for Small Population over the Internet
Explore efficient protocols for secure multiparty computation, focusing on fairness and guaranteed output delivery in 3-party and 4-party settings over the internet.
Stacked Garbling for Disjunctive Zero-Knowledge Proofs
Explore advanced cryptographic techniques for disjunctive zero-knowledge proofs, focusing on stacked garbling and its applications in secure computation and privacy-preserving protocols.
No Data, No Problem - Giving Nuclear Inspectors Better Tools Without Revealing State Secrets
Explore privacy-preserving computation in nuclear safeguards, focusing on garbled circuits for anomaly detection without compromising sensitive information between inspectors and facilities.
Multiparty Computation and Garbled Circuits - Session 204
Explore secure multiparty computation and garbled circuits, advanced cryptographic techniques for privacy-preserving collaborative computations and secure function evaluation.
Garbled Circuits - Eurocrypt 2024
Explore cutting-edge cryptographic techniques and advancements in garbled circuits at this Eurocrypt 2024 session, chaired by Peter Scholl.
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.
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.