Amanote Research
Register
Sign In
Efficient Secure Two-Party Computation Against Malicious Adversaries
doi 10.18130/v36f8p
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Chih-hao Shen
Publisher
University of Virginia
Related search
Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries
Secure Two-Party Computation Over Unreliable Channels
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficiently Making Secure Two-Party Computation Fair
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Faster Secure Two-Party Computation With Less Memory
Hiding the Input-Size in Secure Two-Party Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Towards Characterizing Complete Fairness in Secure Two-Party Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fast and Maliciously Secure Two-Party Computation Using the GPU
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The All-Or-Nothing Nature of Two-Party Secure Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Protocols for Set Intersection and Pattern Matching With Security Against Malicious and Covert Adversaries
