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 20 of 22 for “"Garbled Circuits"”.

  1. New Directions in Garbled Circuits

    The Garbled Circuit (GC) technique is foundational in secure multiparty computation (MPC). GC allows parties to jointly and securely compute functions of their private inputs while revealing nothing but the output. GC is unique in that it achieves secure computation while using only a constant …

    gatech Repository record for New Directions in Garbled Circuits (opens in a new tab)

  2. Secure and Trusted Partial White-box Verification Based on Garbled Circuits

    … the “partial white-box verification”. Taking circuits as the description means, we regard the program as a circuit graph. Making the structure of the graph public, we manage to make the verification process in such a graph partially white-box. Via garbled circuits, commitment schemes and other …

    mcmaster Repository record for Secure and Trusted Partial White-box Verification Based on Garbled Circuits (opens in a new tab)

  3. Design and Implementation of Maliciously Secure Two-Party Computation Based on Garbled Circuits

    … a computation is feasible using the so called garbled circuits and given an Oblivious Transfer protocol. In this thesis, we follow Yao’s garbled circuit approach and focus on efficient protocols that are secure against malicious adversaries. We examine three different categories of …

    calgary Repository record for Design and Implementation of Maliciously Secure Two-Party Computation Based on Garbled Circuits (opens in a new tab)

  4. Comparison of Fully Homomorphic Encryption and Garbled Circuits approaches in Privacy-Preserving Machine Learning

    … are Fully Homomorphic Encryption (FHE) and Garbled Circuits (GC). This thesis presents a comparative evaluation of FHE and GC for secure neural network inference (SNNI). A two-layer neural network (NN) was implemented using the CKKS scheme from the Microsoft SEAL library (FHE) and the …

    unt Repository record for Comparison of Fully Homomorphic Encryption and Garbled Circuits approaches in Privacy-Preserving Machine Learning (opens in a new tab)

  5. ON THE SECURITY OF CRYPTOGRAPHIC CIRCUITS:PROTECTION AGAINST PROBING ATTACKS AND PERFORMANCE IMPROVEMENT OF GARBLED CIRCUITS

    … the parties are only two, from literature the garbled circuit protocol is a solution that allows to reach a result implying some secrets, without sharing them. The cost of this protocol depends on the number of extit{and} gates in the circuit that implements the Boolean function describing the …

    milano Repository record for ON THE SECURITY OF CRYPTOGRAPHIC CIRCUITS:PROTECTION AGAINST PROBING ATTACKS AND PERFORMANCE IMPROVEMENT OF GARBLED CIRCUITS (opens in a new tab)

  6. Privacy preserving linkage and sharing of sensitive data

    … and sharing without third party services. We use garbled circuits secure computation to design and build a system to perform the record linkages between two parties without sharing their data. Our design uses Bloom lters as inputs to the garbled circuits and performs a probabilistic record linkage …

    colostate Repository record for Privacy preserving linkage and sharing of sensitive data (opens in a new tab)

  7. Optimizing Secure Function Evaluation on Mobile Devices

    … privacy-preserving applications. Generating the circuits on smartphones which allow for executing customized functions, however, is infeasible for most problems due to memory constraints. In this thesis, we develop a new methodology for generating circuits that is memory-efficient. Using the …

    oregon Repository record for Optimizing Secure Function Evaluation on Mobile Devices (opens in a new tab)

  8. Joint Linear and Nonlinear Computation with Data Encryption for Efficient Privacy-Preserving Deep Learning

    … (e.g., Homomorphic Encryption (HE) and Garbled Circuits (GC)). As such, this dissertation targets deeply optimizing state-of-the-art frameworks as well as newly designing efficient modules by joint linear and nonlinear computation, with data encryption, to further boost the overall …

    odu Repository record for Joint Linear and Nonlinear Computation with Data Encryption for Efficient Privacy-Preserving Deep Learning (opens in a new tab)

  9. Information-Theoretic Secure Outsourced Computation in Distributed Systems

    … over other popular secure MPC primitives like garbled circuits (GC) -- it provides information-theoretic security guarantee, requires no complex long-integer operations, and often leads to more efficient protocols. Nonetheless, SSS receives less attention in the signal processing community …

    uky-thes Repository record for Information-Theoretic Secure Outsourced Computation in Distributed Systems (opens in a new tab)

  10. Black-Box Barriers Behind Registration-Based Encryption

    … such as indistinguishability obfuscation or garbled circuits. However, non-black-box constructions often face practical inefficiencies. Recent works have shown that black-box constructions of RBE are achievable, though these constructions often involve a relaxed model where the Common …

    waterloo Repository record for Black-Box Barriers Behind Registration-Based Encryption (opens in a new tab)

  11. TOWARD LOWER COMMUNICATION IN GARBLED CIRCUIT EVALUATION

    … the SMC problem relies on the design of Garbled Circuit (GC). In Garbled Circuits (GCs), the function to be computed is represented as a Boolean circuit composed of binary gates. The input and output wire of each gate is masked such that the party evaluating the Garbled Boolean Circuits …

    milano Repository record for TOWARD LOWER COMMUNICATION IN GARBLED CIRCUIT EVALUATION (opens in a new tab)

  12. Towards Secure Multi-Party Computation on the Internet: Few Rounds and Many Parties

    … constant-round protocols based on multi-party garbled circuits. Chapter 3 and Chapter 4 deal with the very strong setting where an active adversary corrupts all but one parties. The former achieves such goal by using homomorphic encryption for low-depth circuits. The latter, based on subsequent …

    bristol Repository record for Towards Secure Multi-Party Computation on the Internet: Few Rounds and Many Parties (opens in a new tab) Download PDF for Towards Secure Multi-Party Computation on the Internet: Few Rounds and Many Parties (opens in a new tab)

  13. Reducing Communication Costs in Multi-Party Computation

    … to mix two different MPC techniques called <i>garbled circuits</i> and <i>secret-sharing</i> in a secure way, even when the adversary deviates arbitrarily from the protocol description. Mixing these methods is useful as they optimize for different aspects of<br/> computation.

    bristol Repository record for Reducing Communication Costs in Multi-Party Computation (opens in a new tab) Download PDF for Reducing Communication Costs in Multi-Party Computation (opens in a new tab)

  14. Enabling secure multi-party computation with FPGAs in the datacenter

    … results accelerating MPC protocols based on Garbled Circuits with FPGAs. Our conclusion is that Secret Sharing in the datacenter is competitive and, when implemented on FPGA hardware, is able to use at least 10$\times$ fewer computer resources than the original work using CPUs. Finally, we …

    bu Repository record for Enabling secure multi-party computation with FPGAs in the datacenter (opens in a new tab)

  15. Hiding secrets in public random functions

    … and watermarking. In addition, we build reusable garbled circuits from PCPRFs. 2. We then study how to construct cryptographic hash functions that satisfy strong random oracle-like properties. In particular, we focus on the notion of correlation intractability, which requires that given the …

    bu Repository record for Hiding secrets in public random functions (opens in a new tab)

  16. Key Retrieval from Low-Entropy Secrets

    … The first one is based on block ciphers and garbled circuits and the second is based on the pseu- dorandomness of the shifted Legendre symbol and Vector Oblivious Linear Evaluation. Finally, we study robust combiners for OPRFs. We show that in general, there cannot bearobustOPRFcombiner. …

    ethz Repository record for Key Retrieval from Low-Entropy Secrets (opens in a new tab)

  17. Exploiting Power for Smartphone Security and Privacy

    … realistic constraints such as different Tor circuits types and battery charging levels. We were able to correctly identify webpages visited using the official mobile Tor browser with accuracy of up to 85.7% when the battery was fully charged, and up to 46% when the battery level was between …

    wm-mary Repository record for Exploiting Power for Smartphone Security and Privacy (opens in a new tab)

  18. Towards privacy-aware mobile-based continuous authentication systems

    … and performing the Eigen decomposition using Garbled circuits. We implemented our protocols using Java and Obliv-C, and conducted experiments on public datasets. We show that our protocols are efficient, and preserve the privacy while maintaining the accuracy.</p>

    iastate Repository record for Towards privacy-aware mobile-based continuous authentication systems (opens in a new tab)

  19. Efficient techniques for secure multiparty computation on mobile devices

    … for outsourcing the costly operations in garbled circuit SMC protocols to an untrusted Cloud to allow resource-constrained devices to use this cryptographic primitive. By providing the mobile device with a third party Cloud provider, we show that it is possible for a mobile device to …

    gatech Repository record for Efficient techniques for secure multiparty computation on mobile devices (opens in a new tab)

  20. Communication and Round Balanced Oblivious FSM Evaluation

    Privacy is a major issue in the age of the Internet. Many advances are being made in Cryptography regarding performing computations over private data, both in homomorphic encryption, multi-party computation, and applications that put these to use. Herein we present a multiparty protocol for the …

    washington Repository record for Communication and Round Balanced Oblivious FSM Evaluation (opens in a new tab)

Page 1 of 2