Amanote Research
Register
Sign In
Faster Secure Two-Party Computation With Less Memory
doi 10.1145/2484313.2484369
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2013
Authors
Wilko Henecka
Thomas Schneider
Publisher
ACM Press
Related search
Efficiently Making Secure Two-Party Computation Fair
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Secure Two-Party Computation Over Unreliable Channels
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Secure Two-Party Computation Against Malicious Adversaries
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
Span Programs and General Secure Multi-Party Computation
BRICS Report Series
Privacy-Aware MapReduce Based Multi-Party Secure Skyline Computation
Information (Switzerland)
Information Systems
