MPC WIP
This commit is contained in:
jaseg
parent
3a9457e5bf
commit
daf79e4487
2 changed files with 194 additions and 12 deletions
|
|
@ -98,11 +98,24 @@ or malicious security at some performance tradeoff. In a practical setting, a se
|
|||
provide additional security over just having one party run the computation except in some situations where inadvertent
|
||||
side-channel leakage is a concern.
|
||||
|
||||
\subsection{Fundamental Primitives}
|
||||
\subsubsection{Secret Sharing}
|
||||
\subsubsection{Oblivious Transfer}
|
||||
\subsection{Oblivious Transfer}
|
||||
|
||||
\subsection{Boolean MPC}
|
||||
Before we can go into details of multiparty computation, we need to define an important primitive. Oblivious Transfer is
|
||||
a cryptographic protocol between two parties that enables one party, the \emph{Sender}, to share one of two values to
|
||||
the other party, the \emph{Receiver}. The Receiver can choose which of the two values it wants to receive by inputting a
|
||||
choice bit $b$ into the protocol. After the protocol has been executed, the Receiver learns \emph{only} its chosen
|
||||
value, and learns nothing about the other input value that the Sender provided. Meanwhile, the Sender learns nothing
|
||||
about the choice bit $b$ of the receiver.
|
||||
|
||||
\subsubsection{OT extensions}
|
||||
|
||||
Oblivious Transfer is a public-key primitive, requiring asymmetric cryptographic operations. For this reason, ``raw''
|
||||
Oblivious Transfer is not particularly fast. In practice, this issue is solved by applying a technique called Oblivious
|
||||
Transfer Extensions (OTe)\cite{ishaiExtendingObliviousTransfers2003}. Using OTe, a fixed, small number of public-key
|
||||
base Oblivious Transfer instances can be extended into an arbitrarily large number of Oblivious Transfer instances using
|
||||
only invocations of a pseudo-random function (PRF) such as a cryptographic hash function.
|
||||
|
||||
\subsection{Boolean MPC with Yao's Garbled Circuits}
|
||||
% Yao's Garbled Circuits
|
||||
Yao's Garbled Circuits (GC) protocol is one of the oldest Multiparty Computation protocols, dating back to the 1980ies.
|
||||
In Yao's GC, two parties jointly compute a function that is represented as a circuit of binary logic gates by evaluating
|
||||
|
|
@ -112,7 +125,8 @@ wire $w_i$ in the circuit is assigned two random cryptographic secret keys $w_i^
|
|||
the logical value $0$ and one $w_i^1$ for the value $1$. The mapping from logic values to these keys is assigned
|
||||
randomly by the generator, and unknown to the evaluator~\cite{
|
||||
yaoHowGenerateExchange1986,
|
||||
beaverComplexitySecureProtocols1990
|
||||
beaverComplexitySecureProtocols1990,
|
||||
evansPragmaticIntroductionSecure
|
||||
}.
|
||||
|
||||
Gates are represented in Yao's GC as truth tables with one row for every combination of input wire values. Each row of
|
||||
|
|
@ -142,17 +156,26 @@ evaluator perform an 1-out-of-2 oblivious transfer with the generator assuming t
|
|||
input wire labels $w_i^0$ and $w_i^1$ as the two choices, and the evaluator submitting its chosen input bit $b$ as the
|
||||
OT's choice bit.
|
||||
|
||||
\subsection{Arithmetic MPC}
|
||||
% BGW
|
||||
|
||||
\subsection{Practical Application}
|
||||
\subsubsection{Preprocessing and Online Phases}
|
||||
\subsubsection{OT extensions}
|
||||
\subsubsection{Constant-Round MPC}
|
||||
Yao's GC has good performance since the only asymmetric cryptographic primitive used is in the Oblivious Transfer needed
|
||||
for the evaluator's hidden inputs. The generation and the evaluation of the garbled circuit itself both only require
|
||||
evaluations of a pseudorandom function such as a cryptographic hash or a cipher. Still, performing a computation using a
|
||||
Garbled Circuit is many times slower than performing it in the clear. Intuitively, each single-bit gate in the garbled
|
||||
circuit results in several cryptographic operations with input and output sizes of dozens or hundreds of bits.
|
||||
Practically useful functions such as AES encryption have circuit implementations measuring thousands or tens of
|
||||
thousands of gates, meaning these costs quickly escalate for practical problem sizes.
|
||||
\cite{
|
||||
boyarNewCombinationalLogic2010,
|
||||
songhoriTinyGarbleHighlyCompressed2015
|
||||
}
|
||||
|
||||
%\subsection{Practical Application}
|
||||
%\subsubsection{Preprocessing and Online Phases}
|
||||
%\subsubsection{Constant-Round MPC}
|
||||
|
||||
\subsection{Performance}
|
||||
|
||||
% zahurTwoHalvesMake2015,wangGlobalScaleSecureMultiparty2017,kellerMPSPDZVersatileFramework2020,dalskovFantasticFourHonestMajority
|
||||
|
||||
\subsection{Practical Deployments}
|
||||
|
||||
\subsection{Solutions}
|
||||
|
|
|
|||
159
main.bib
159
main.bib
|
|
@ -778,6 +778,23 @@
|
|||
keywords = {Digital signalbehandling,Digital techniques,Impedance (Electricity),Signal integrity (Electronics),Signal processing}
|
||||
}
|
||||
|
||||
@inproceedings{boyarNewCombinationalLogic2010,
|
||||
title = {A {{New Combinational Logic Minimization Technique}} with {{Applications}} to {{Cryptology}}},
|
||||
booktitle = {Experimental {{Algorithms}}},
|
||||
author = {Boyar, Joan and Peralta, René},
|
||||
editor = {Festa, Paola},
|
||||
date = {2010},
|
||||
pages = {178--189},
|
||||
publisher = {Springer},
|
||||
location = {Berlin, Heidelberg},
|
||||
doi = {10.1007/978-3-642-13193-6_16},
|
||||
abstract = {A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the non-linearity of a circuit – as measured by the number of non-linear gates it contains – is reduced. The second step reduces the number of gates in the linear components of the already reduced circuit. The technique can be applied to arbitrary combinational logic problems, and often yields improvements even after optimization by standard methods has been performed. In this paper we show the results of our technique when applied to the S-box of the Advanced Encryption Standard (AES [6]). This is an experimental proof of concept, as opposed to a full-fledged circuit optimization effort. Nevertheless the result is, as far as we know, the circuit with the smallest gate count yet constructed for this function. We have also used the technique to improve the performance (in software) of several candidates to the Cryptographic Hash Algorithm Competition. Finally, we have experimentally verified that the second step of our technique yields significant improvements over conventional methods when applied to randomly chosen linear transformations.},
|
||||
isbn = {978-3-642-13193-6},
|
||||
langid = {english},
|
||||
keywords = {AES,Circuit complexity,linear component minimization,multiplicative complexity,S-box},
|
||||
file = {/home/jaseg/Sync/Research/Zotero/2010_Boyar_Peralta_A New Combinational Logic Minimization Technique with Applications to Cryptology.pdf}
|
||||
}
|
||||
|
||||
@incollection{boyleEfficientPseudorandomCorrelation2019,
|
||||
title = {Efficient {{Pseudorandom Correlation Generators}}: {{Silent OT Extension}} and {{More}}},
|
||||
shorttitle = {Efficient {{Pseudorandom Correlation Generators}}},
|
||||
|
|
@ -1438,6 +1455,14 @@
|
|||
file = {/home/jaseg/Zotero/storage/G9UFDMFK/Curran et al. - 2015 - Modeling and characterization of PCB coils for ind.pdf}
|
||||
}
|
||||
|
||||
@article{dalskovFantasticFourHonestMajority,
|
||||
title = {Fantastic {{Four}}: {{Honest-Majority Four-Party Secure Computation With Malicious Security}}},
|
||||
author = {Dalskov, Anders and Escudero, Daniel and Keller, Marcel},
|
||||
abstract = {This work introduces a novel four-party honest-majority MPC protocol with active security that achieves comparable efficiency to equivalent protocols in the same setting, while having a much simpler design and not relying on functiondependent preprocessing. Our initial protocol satisfies security with abort, but we present some extensions to achieve guaranteed output delivery. Unlike previous works, we do not achieve this by delegating the computation to one single party that is identified to be honest, which is likely to hinder the adoption of these technologies as it centralizes sensitive data. Instead, our novel approach guarantees termination of the protocol while ensuring that no single party (honest or corrupt) learns anything beyond the output.},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/Z68N5LGE/Dalskov et al. - Fantastic Four Honest-Majority Four-Party Secure .pdf}
|
||||
}
|
||||
|
||||
@incollection{damgardUnconditionallySecureUniversally2013,
|
||||
title = {Unconditionally {{Secure}} and {{Universally Composable Commitments}} from {{Physical Assumptions}}},
|
||||
booktitle = {Advances in {{Cryptology}} - {{ASIACRYPT}} 2013},
|
||||
|
|
@ -1804,6 +1829,24 @@
|
|||
file = {/home/jaseg/Zotero/storage/LJIBXD6I/Fan et al. - 2024 - A Simultaneous Wireless Power and Coil Inductance .pdf}
|
||||
}
|
||||
|
||||
@article{fengConcretelyEfficientSecure2022,
|
||||
title = {Concretely Efficient Secure Multi-Party Computation Protocols: Survey and More},
|
||||
shorttitle = {Concretely Efficient Secure Multi-Party Computation Protocols},
|
||||
author = {Feng, Dengguo and Yang, Kang},
|
||||
date = {2022},
|
||||
journaltitle = {Security and Safety},
|
||||
shortjournal = {Security and Safety},
|
||||
volume = {1},
|
||||
pages = {2021001},
|
||||
issn = {2826-1275},
|
||||
doi = {10.1051/sands/2021001},
|
||||
url = {https://sands.edpsciences.org/10.1051/sands/2021001},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on their private inputs, and reveals nothing but the output of the function. In the last decade, MPC has rapidly moved from a purely theoretical study to an object of practical interest, with a growing interest in practical applications such as privacy-preserving machine learning (PPML). In this paper, we comprehensively survey existing work on concretely efficient MPC protocols with both semi-honest and malicious security, in both dishonestmajority and honest-majority settings. We focus on considering the notion of security with abort, meaning that corrupted parties could prevent honest parties from receiving output after they receive output. We present high-level ideas of the basic and key approaches for designing different styles of MPC protocols and the crucial building blocks of MPC. For MPC applications, we compare the known PPML protocols built on MPC, and describe the efficiency of private inference and training for the state-of-the-art PPML protocols. Furthermore, we summarize several challenges and open problems to break though the efficiency of MPC protocols as well as some interesting future work that is worth being addressed. This survey aims to provide the recent development and key approaches of MPC to researchers, who are interested in knowing, improving, and applying concretely efficient MPC protocols.},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/JR694KUR/Feng and Yang - 2022 - Concretely efficient secure multi-party computatio.pdf}
|
||||
}
|
||||
|
||||
@article{fernandez-hernandezNavigationMessageAuthentication2016,
|
||||
title = {A {{Navigation Message Authentication Proposal}} for the {{Galileo Open Service}}},
|
||||
author = {Fernández-Hernández, Ignacio and Rijmen, Vincent and Seco-Granados, Gonzalo and Simon, Javier and Rodríguez, Irma and Calle, J. David},
|
||||
|
|
@ -2831,6 +2874,27 @@
|
|||
x-fetchedfrom = {Google Scholar}
|
||||
}
|
||||
|
||||
@incollection{ishaiExtendingObliviousTransfers2003,
|
||||
title = {Extending {{Oblivious Transfers Efficiently}}},
|
||||
booktitle = {Advances in {{Cryptology}} - {{CRYPTO}} 2003},
|
||||
author = {Ishai, Yuval and Kilian, Joe and Nissim, Kobbi and Petrank, Erez},
|
||||
editor = {Boneh, Dan},
|
||||
editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
|
||||
editoratype = {redactor},
|
||||
date = {2003},
|
||||
volume = {2729},
|
||||
pages = {145--161},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
location = {Berlin, Heidelberg},
|
||||
doi = {10.1007/978-3-540-45146-4_9},
|
||||
url = {http://link.springer.com/10.1007/978-3-540-45146-4_9},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers “for free,” can one implement a large number of oblivious transfers? Beaver has shown how to extend oblivious transfers given a one-way function. However, this protocol is inefficient in practice, in part due to its non-black-box use of the underlying one-way function.},
|
||||
isbn = {978-3-540-40674-7 978-3-540-45146-4},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/6DAXJHL2/Ishai et al. - 2003 - Extending Oblivious Transfers Efficiently.pdf}
|
||||
}
|
||||
|
||||
@online{ISOIEC19790,
|
||||
title = {{{ISO}}/{{IEC}} 19790:2025},
|
||||
shorttitle = {{{ISO}}/{{IEC}} 19790},
|
||||
|
|
@ -3018,6 +3082,25 @@
|
|||
file = {/home/jaseg/Zotero/storage/M6LSM6ML/Keller et al. - 2017 - Faster Secure Multi-party Computation of AES and D.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{kellerMPSPDZVersatileFramework2020,
|
||||
title = {{{MP-SPDZ}}: {{A Versatile Framework}} for {{Multi-Party Computation}}},
|
||||
shorttitle = {{{MP-SPDZ}}},
|
||||
booktitle = {Proceedings of the 2020 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
|
||||
author = {Keller, Marcel},
|
||||
date = {2020-10-30},
|
||||
pages = {1575--1590},
|
||||
publisher = {ACM},
|
||||
location = {Virtual Event USA},
|
||||
doi = {10.1145/3372297.3417872},
|
||||
url = {https://dl.acm.org/doi/10.1145/3372297.3417872},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {Multi-Protocol SPDZ (MP-SPDZ) is a fork of SPDZ-2 (Keller et al., CCS ’13), an implementation of the multi-party computation (MPC) protocol called SPDZ (Damgård et al., Crypto ’12). MP-SPDZ extends SPDZ-2 to 30 MPC protocol variants, all of which can be used with the same high-level programming interface based on Python. This considerably simplifies comparing the cost of different protocols and security models.},
|
||||
eventtitle = {{{CCS}} '20: 2020 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
|
||||
isbn = {978-1-4503-7089-9},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/PC2WPDCY/Keller - 2020 - MP-SPDZ A Versatile Framework for Multi-Party Com.pdf}
|
||||
}
|
||||
|
||||
@book{kelly1993,
|
||||
title = {Fundamentals of Mechanical Vibrations},
|
||||
author = {Kelly, S. Graham},
|
||||
|
|
@ -5869,6 +5952,23 @@ Archive 2: https://web.archive.org/web/20250510104017/https://de.linkedin.com/pu
|
|||
abstract = {Geometric algorithms implemented using rounded arithmetic are prone to robustness problems. Geometric algorithms are often a mix of arithmetic and combinatorial computations, arising from the need to create geometric data structures that are themselves a complex mix of numerical and combinatorial data. Decisions that influence the topology of a geometric structure are made on the basis of certain arithmetic calculations, but the inexactness of these calculations may lead to inconsistent decisions, causing the algorithm to produce a topologically invalid result or to fail catastrophically. The research reported here investigates ways to produce robust algorithms with inexact computation. I present two algorithms for operations on piecewise linear (polygonal/polyhedral) shapes. Both algorithms are topologically robust, meaning that they are guaranteed to generate a topologically valid result from a topologically valid input, irrespective of numerical errors in the computations. The first algorithm performs the Boolean operation in 3D, and also in 2D. The main part of this algorithm is a series of interdependent operations. The relationship between these operations ensures a consistency in these operations, which, I prove, guarantees the generation of a shape representation with valid topology. The basic algorithm may generate geometric artifacts such as gaps and slivers, which generally can be removed by a data-smoothing post-process. The second algorithm presented performs simplification in 2D, converting a geometrically invalid (but topologically valid) shape representation into one that is fully valid. This algorithm is based on a variant of the Bentley-Ottmann sweep line algorithm, but with additional rules to handle situations not possible under an exact implementation. Both algorithms are presented in the context of what is required of an algorithm in order for it to be classed as robust in some sense. I explain why the formulaic approach used for the Boolean algorithm cannot readily be used for the simplification process. I also give essential code details for a C++ implementation of the 2D simplification algorithm, and discuss the results of extreme tests designed to show up any problems. Finally, I discuss floating-point arithmetic, present error analysis for the floating-point computation of the intersection point between two segments in 2D, and discuss how such errors affect both the simplification algorithm and the basic Boolean algorithm in 2D.}
|
||||
}
|
||||
|
||||
@inproceedings{songhoriTinyGarbleHighlyCompressed2015,
|
||||
title = {{{TinyGarble}}: {{Highly Compressed}} and {{Scalable Sequential Garbled Circuits}}},
|
||||
shorttitle = {{{TinyGarble}}},
|
||||
booktitle = {2015 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
|
||||
author = {Songhori, Ebrahim M. and Hussain, Siam U. and Sadeghi, Ahmad-Reza and Schneider, Thomas and Koushanfar, Farinaz},
|
||||
date = {2015-05},
|
||||
pages = {411--428},
|
||||
issn = {2375-1207},
|
||||
doi = {10.1109/SP.2015.32},
|
||||
url = {https://ieeexplore.ieee.org/document/7163039/},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {We introduce Tiny Garble, a novel automated methodology based on powerful logic synthesis techniques for generating and optimizing compressed Boolean circuits used in secure computation, such as Yao's Garbled Circuit (GC) protocol. Tiny Garble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC. We introduce new libraries and transformations, such that our sequential circuits can be optimized and securely evaluated by interfacing with available garbling frameworks. The circuit compactness makes the memory footprint of the garbling operation fit in the processor cache, resulting in fewer cache misses and thereby less CPU cycles. Our proof-of-concept implementation of benchmark functions using Tiny Garble demonstrates a high degree of compactness and scalability. We improve the results of existing automated tools for GC generation by orders of magnitude, for example, Tiny Garble can compress the memory footprint required for 1024-bit multiplication by a factor of 4,172, while decreasing the number of non-XOR gates by 67\%. Moreover, with Tiny Garble we are able to implement functions that have never been reported before, such as SHA-3. Finally, our sequential description enables us to design and realize a garbled processor, using the MIPS I instruction set, for private function evaluation. To the best of our knowledge, this is the first scalable emulation of a general purpose processor.},
|
||||
eventtitle = {2015 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
|
||||
keywords = {Garbled Circuit,Hardware design languages,Hardware Synthesis,Libraries,Logic Design,Logic gates,Optimization,Protocols,Secure Function Evaluation,Sequential circuits,Wires},
|
||||
file = {/home/jaseg/Sync/Research/Zotero/2015_Songhori et al_TinyGarble.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{songPOSTERInaudibleVoice2017,
|
||||
title = {{{POSTER}}: {{Inaudible Voice Commands}}},
|
||||
shorttitle = {{{POSTER}}},
|
||||
|
|
@ -6284,6 +6384,27 @@ Archive 2: https://web.archive.org/web/20250510104017/https://de.linkedin.com/pu
|
|||
urldate = {2021-07-13}
|
||||
}
|
||||
|
||||
@incollection{tuylsVisualCryptoDisplays2004,
|
||||
title = {Visual {{Crypto Displays Enabling Secure Communications}}},
|
||||
booktitle = {Security in {{Pervasive Computing}}},
|
||||
author = {Tuyls, Pim and Kevenaar, Tom and Schrijen, Geert-Jan and Staring, Toine and Van Dijk, Marten},
|
||||
editor = {Hutter, Dieter and Müller, Günter and Stephan, Werner and Ullmann, Markus},
|
||||
editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
|
||||
editoratype = {redactor},
|
||||
date = {2004},
|
||||
volume = {2802},
|
||||
pages = {271--284},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
location = {Berlin, Heidelberg},
|
||||
doi = {10.1007/978-3-540-39881-3_23},
|
||||
url = {https://link.springer.com/10.1007/978-3-540-39881-3_23},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {In this paper we describe a low-tech and user friendly solution for secure two-way communication between two parties over a network of untrusted devices. We present a solution in which displays play a central role. Our approach guarantees privacy and allows to check the authenticity of information presented on displays. Furthermore, we provide the user with a secure return channel. To this end we propose to provide every user with a small decryption display which is, for example, integrated in a credit card and requires very limited computing power. The authentication and security are based on visual cryptography which was first introduced by Naor and Shamir in 1994. We solve some practical shortcomings of traditional visual cryptography and develop protocols for two-way authentication and privacy in untrusted environments.},
|
||||
isbn = {978-3-540-20887-7 978-3-540-39881-3},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/7ZN8T82V/Tuyls et al. - 2004 - Visual Crypto Displays Enabling Secure Communicati.pdf}
|
||||
}
|
||||
|
||||
@article{tyagiOrcaBlocklistingSenderAnonymous,
|
||||
title = {Orca: {{Blocklisting}} in {{Sender-Anonymous Messaging}}},
|
||||
author = {Tyagi, Nirvan and Len, Julia and Miers, Ian and Ristenpart, Thomas},
|
||||
|
|
@ -6619,6 +6740,24 @@ Archive 2: https://web.archive.org/web/20250510104017/https://de.linkedin.com/pu
|
|||
file = {/home/jaseg/Sync/Research/Zotero/Wang et al_GhostTouch.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{wangGlobalScaleSecureMultiparty2017,
|
||||
title = {Global-{{Scale Secure Multiparty Computation}}},
|
||||
booktitle = {Proceedings of the 2017 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
|
||||
author = {Wang, Xiao and Ranellucci, Samuel and Katz, Jonathan},
|
||||
date = {2017-10-30},
|
||||
pages = {39--56},
|
||||
publisher = {ACM},
|
||||
location = {Dallas Texas USA},
|
||||
doi = {10.1145/3133956.3133979},
|
||||
url = {https://dl.acm.org/doi/10.1145/3133956.3133979},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated information; we then show how to use this information to distributively construct a single “authenticated” garbled circuit that is evaluated by one party. Our resulting protocol improves upon the state-of-the-art both asymptotically and concretely. We validate these claims via several experiments demonstrating both the efficiency and scalability of our protocol: • Efficiency: For three-party computation over a LAN, our protocol requires only 95 ms to evaluate AES. This is roughly a 700× improvement over the best prior work, and only 2.5× slower than the best known result in the two-party setting. In general, for n-party computation our protocol improves upon prior work (which was never implemented) by a factor of more than 230n, e.g., an improvement of 3 orders of magnitude for 5-party computation. • Scalability: We successfully executed our protocol with a large number of parties located all over the world, computing (for example) AES with 128 parties across 5 continents in under 3 minutes. Our work represents the largest-scale demonstration of secure computation to date.},
|
||||
eventtitle = {{{CCS}} '17: 2017 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
|
||||
isbn = {978-1-4503-4946-8},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/HTT44SBU/Wang et al. - 2017 - Global-Scale Secure Multiparty Computation.pdf}
|
||||
}
|
||||
|
||||
@article{wangGroupCrossSymmetricalInductor2006,
|
||||
title = {Group-{{Cross Symmetrical Inductor}} ({{GCSI}}): {{A New Inductor Structure With Higher Self-Resonance Frequency}} and\${{Q}}\${{Factor}}},
|
||||
shorttitle = {Group-{{Cross Symmetrical Inductor}} ({{GCSI}})},
|
||||
|
|
@ -7106,6 +7245,26 @@ Archive 2: https://web.archive.org/web/20250510104017/https://de.linkedin.com/pu
|
|||
file = {/home/jaseg/Zotero/storage/Q2LQVJM7/Yu et al. - 2022 - Secret-Key Provisioning With Collaborative Routing.pdf}
|
||||
}
|
||||
|
||||
@incollection{zahurTwoHalvesMake2015,
|
||||
title = {Two {{Halves Make}} a {{Whole}}: {{Reducing Data Transfer}} in {{Garbled Circuits Using Half Gates}}},
|
||||
shorttitle = {Two {{Halves Make}} a {{Whole}}},
|
||||
booktitle = {Advances in {{Cryptology}} - {{EUROCRYPT}} 2015},
|
||||
author = {Zahur, Samee and Rosulek, Mike and Evans, David},
|
||||
editor = {Oswald, Elisabeth and Fischlin, Marc},
|
||||
date = {2015},
|
||||
volume = {9057},
|
||||
pages = {220--250},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
location = {Berlin, Heidelberg},
|
||||
doi = {10.1007/978-3-662-46803-6_8},
|
||||
url = {http://link.springer.com/10.1007/978-3-662-46803-6_8},
|
||||
urldate = {2025-08-15},
|
||||
abstract = {The well-known classical constructions of garbled circuits use four ciphertexts per gate, although various methods have been proposed to reduce this cost. The best previously known methods for optimizing AND gates (two ciphertexts; Pinkas et al., ASIACRYPT 2009) and XOR gates (zero ciphertexts; Kolesnikov and Schneider, ICALP 2008) were incompatible, so most implementations used the best known method compatible with free-XOR gates (three ciphertexts; Kolesnikov and Schneider, ICALP 2008). In this work we show how to simultaneously garble AND gates using two ciphertexts and XOR gates using zero ciphertexts, resulting in smaller garbled circuits than any prior scheme. The main idea behind our construction is to break an AND gate into two half-gates —AND gates for which one party knows one input. Each half-gate can be garbled with a single ciphertext, so our construction uses two ciphertexts for each AND gate while being compatible with free-XOR gates. The price for the reduction in size is that the evaluator must perform two cryptographic operations per AND gate, rather than one as in previous schemes. We experimentally demonstrate that our garbling scheme leads to an overall decrease in time (up to 25\%), bandwidth (up to 33\%), and energy use (up to 20\%) over several benchmark applications. We show that our construction is optimal for a large class of garbling schemes encompassing all known practical garbling techniques.},
|
||||
isbn = {978-3-662-46802-9 978-3-662-46803-6},
|
||||
langid = {english},
|
||||
file = {/home/jaseg/Zotero/storage/46G42LQL/Zahur et al. - 2015 - Two Halves Make a Whole Reducing Data Transfer in.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{zeppelzauerSoniControlMobileUltrasonic2018,
|
||||
title = {{{SoniControl}} - {{A Mobile Ultrasonic Firewall}}},
|
||||
booktitle = {Proceedings of the 26th {{ACM}} International Conference on {{Multimedia}}},
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue