Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"two party computation"”.
-
Highly Efficient Commodity-based Two-Party Computation for Smartphones
Secure Two-Party Computation (2PC) enables a set of parties to compute a function of their inputs while keeping these inputs private. While theoretical solutions for solving 2PC problems were known for decades, efficient implementations have been developed only recently. The delay in implementation …
-
Compilation Techniques for Actively Secure Mixed Mode Two Party Computation
Secure multiparty computation allows two or more parties to compute a function without leaking unnecessary information about their inputs to other parties. In traditional secure multiparty computation protocols, the function is represented as a circuit and each gate of the circuit is securely …
-
Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison
Multi-party computation is receiving more and more attention as its application in more areas prove promising. In this research, our focus is on secure two-party computation. In particular, we propose non-interactive constructions for securely computing private equality testing and greater-than …
-
Design and Implementation of Maliciously Secure Two-Party Computation Based on Garbled Circuits
… three approaches to provide efficient Secure Two- Party Computation (2PC) protocols that are secure in presence of malicious adversaries. The field of secure two-party computation enables two mutually distrusting parties, each with their own private input, to run a computation of an arbitrary …
-
Efficient Multiparty Computation from Lossy Threshold Encryption
… four contributions concerning secure multiparty computation. The first contribution is a new lossy threshold encryption scheme. This is the first encryption scheme that is both a lossy and a threshold encryption scheme. The second contribution is a new oblivious transfer protocol secure …
-
Input Certification for Secure Computation
Secure multi-party computation (SMC) allows its participants to securely compute functionality without revealing their private input and has broad application across a diverse spectrum. In general, to prove the security of a cryptographic construction standard security model, one must consider …
-
Expressiveness of Definitions and Efficiency of Constructions in Computational Cryptography
The computational treatment of cryptography, and indeed any scientific treatment of a problem, is marked by its definitional side and by it constructive side. Results in this thesis better our understanding of both: on one side, they characterize the extent to which computational definitions …
-
Variance: Secure Two-Party Protocol for Solving Yao's Millionaires' Problem in Bitcoin
Secure multiparty protocols are useful tools for parties wishing to jointly compute a function while keeping their input data secret. The millionaires’ problem is the first secure two-party computation problem, where the goal is to securely compare two private numbers without a trusted third-party. …
-
Laconic Evaluation of Branching Programs from the Diffie-Hellman Assumption
Secure two-party computation (2PC) enables two parties to compute a function f on their joint inputs while keeping their inputs private. Laconic cryptography is a special type of 2PC in which this is done with asymptotically optimal communication in only two rounds of communication. The party who …
-
A New Paradigm for Practical Maliciously Secure Multi-Party Computation
Secure Multi-Party Computation (MPC) protocols allow a group of mutually distrusting users to compute a function jointly on their inputs without revealing any information beyond the output. For many years, implementations of MPC protocols have targeted security against semi-honest adversaries, …
-
Enhancing security of cryptographic protocols through better modularization
… we revisit three problems in the areas of secure computation (MPC) and non-interactive zero-knowledge (NIZK) and we propose new ways to modularize the problems by relying on simpler primitives: 1. In the setting of two-party computation (2PC) where one of the participating parties is corrupted by …
-
Private Two-Party Random Minimum Spanning Forest Computation
… itself can be directly applied to any kind of networks, it also has less obvious applications like the approximation of the Traveling Salesman Problem. However, there is only limited work on efficiently computing an MSF in a two-party computation setting, where the input graph is split between …
-
Toward practical and private online services
Today's common online services (social networks, media streaming, messaging, email, etc.) bring convenience. However, these services are susceptible to privacy leaks. Certainly, email snooping by rogue employees, email server hacks, and accidental disclosures of user ratings for movies are some …
-
Space-efficient data sketching algorithms for network applications
Sketching techniques are widely adopted in network applications. Sketching algorithms “encode” data into succinct data structures that can later be accessed and “decoded” for various purposes, such as network measurement, accounting, anomaly detection and etc. Bloom filters and counter braids are …
-
The Limits of Provable Efficiency in Cryptography
… results, and summarize our findings in two distinct areas: 1. We first examine the notion of concrete security loss in reductions from the unforgeability of unique digital signature schemes and related primitives to standard cryptographic assumptions. Specifically, we show that such …
-
Skupinový podpis založený na bezpečném výpočtu více stran
Práce se věnuje implementaci skupinového podpisu, který využívá společný výpočet dvou stran k vypočítání tajné hodnoty využité k podpisu. Díky tomu zůstává soukromý klíč člena skupiny skrytý před manažerem skupiny, a nemůže být manažerem zneužit. Podpisové schéma podporuje revokaci a otevírání …