Amanote Research
Register
Sign In
Variance: Secure Two-Party Protocol for Solving Yao's Millionaires' Problem in Bitcoin
doi 10.18122/b2cd9k
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Joshua Holmes
Publisher
Boise State University
Related search
Statistical Security Conditions for Two-Party Secure Function Evaluation
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
Efficiently Making Secure Two-Party Computation Fair
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
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
Secure Equality Testing Protocols in the Two-Party Setting
Faster Secure Two-Party Computation With Less Memory
Efficient Secure Two-Party Computation Against Malicious Adversaries
Secure Certificateless Two-Party Key Agreement With Short Message
Information Technology and Control
Control
Systems Engineering
Computer Science Applications
Electrical
Electronic Engineering
