Filters








193 Hits in 4.7 sec

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Our first protocol uses oblivious transfer and constitutes the first concretely-efficient constant-round multiparty protocol for the case of no honest majority.  ...  Our protocols work by constructing a multiparty garbled circuit, as proposed in BMR (Beaver et al., STOC 1990).  ...  This is because the circuit must itself be computed via a secure protocol. For example, we do not know how to efficiently perform garbled row-reduction when building a multiparty garbled circuit.  ... 
doi:10.1145/2976749.2978347 dblp:conf/ccs/Ben-EfraimLO16 fatcat:pdeycn26lrcmnbv7erkaqnouqq

Round-Optimal Secure Multiparty Computation with Honest Majority [chapter]

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
2018 Lecture Notes in Computer Science  
infrastructure model with no additional assumptions, or in the plain model assuming two-round semi-honest oblivious transfer.  ...  We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal n-party protocols, tolerating any t < n 2 corruptions. 1.  ...  This research was supported in part by a DARPA/ARL Safeware Grant W911NF-15-C-0213, and a subaward from NSF CNS-1414023.  ... 
doi:10.1007/978-3-319-96881-0_14 fatcat:6onhsimquzggniastap5bnweiq

How to Garble RAM Programs? [chapter]

Steve Lu, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
Our result requires the existence of one-way function and enjoys the same non-interactive properties as Yao's original garbled circuits.  ...  We stress that we avoid converting the RAM programs into circuits.  ...  Each step is a garbled RAM query (done obliviously via our single-round ORAM) followed by a garbled CPU computation.  ... 
doi:10.1007/978-3-642-38348-9_42 fatcat:ykszm343lngqjmyffbjnue5oym

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
When two or more parties need to compute a common result while safeguarding their sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled circuits.  ...  The traditional enabler of SMC is cryptography, but the significant number of cryptographic operations required results in these techniques being impractical for most real-time, online computations.  ...  Like Yao's protocol, the GMW scheme depends on oblivious transfer and represents the function being computed as a Boolean circuit.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34

Secure Multiparty RAM Computation in Constant Rounds [chapter]

Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey
2016 Lecture Notes in Computer Science  
This protocol is obtained by building on the new black-box garbled RAM construction by Garg, Lu, and Ostrovsky [FOCS 2015], and constant-round secure computation protocol for circuits of Beaver, Micali  ...  Secure computation of a random access machine (RAM) program typically entails that it be first converted into a circuit.  ...  On the other hand, the problem of realizing black-box construction for various primitive is still open, e.g. multi-statement non-interactive zero-knowledge [5, 8, 24] and oblivious transfer extension  ... 
doi:10.1007/978-3-662-53641-4_19 fatcat:bpeqitkgqjdlraijgclxx62hdy

Efficient Scalable Constant-Round MPC via Garbled Circuits [chapter]

Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2017 Lecture Notes in Computer Science  
In this paper, we consider the case of constant-round multiparty computation, via the garbled circuit approach of BMR (Beaver et al., STOC 1990).  ...  In particular, for a large number of parties (e.g., 100), our new circuit can be evaluated faster than the standard BMR garbled circuit that uses only AES computations.  ...  However, the technique of BMR [5] for obtaining constant-round protocols via a multiparty garbled circuit has an inherent scalability problem.  ... 
doi:10.1007/978-3-319-70697-9_17 fatcat:cysaevum25bafk56zdb6b4x5gq

Adaptively Secure Two-Party Computation with Erasures [chapter]

Andrew Y. Lindell
2009 Lecture Notes in Computer Science  
Our protocol is based on Yao's garbled-circuit construction and, importantly, is as efficient as the analogous protocol for static corruptions.  ...  In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (like privacy and correctness  ...  (This is because our simulation works by generating a garbled circuit computing f (x, y) = y which must be indistinguishable from a garbled circuit computing C(x, y).  ... 
doi:10.1007/978-3-642-00862-7_8 fatcat:53tpt3fhobaohesufybow4ixlu

Round-Optimal Secure Two-Party Computation [chapter]

Jonathan Katz, Rafail Ostrovsky
2004 Lecture Notes in Computer Science  
Next, we construct protocols for securely computing any (randomized) functionality using only five rounds.  ...  Here, we establish the exact round complexity of secure two-party computation with respect to black-box proofs of security.  ...  He then sends circuit and the f's for oblivious transfer. Round 2 Player 1 sends k pairs (z 0 , z 1 ). Round 3 Player 2 sends k pairs (W 0 , W 1 ).  ... 
doi:10.1007/978-3-540-28628-8_21 fatcat:cp57afc7ijd7teis6zqmhwxl4u

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer [chapter]

Yehuda Lindell, Benny Pinkas
2011 Lecture Notes in Computer Science  
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs.  ...  We provide an exact, concrete analysis of the efficiency of our scheme and demonstrate that (at least for not very small circuits) our protocol is more efficient than any other known today.  ...  Acknowledgements We thank Bo Zhang for pointing out an error in the single-choice cut-and-choose oblivious transfer protocol in an earlier version of this work.  ... 
doi:10.1007/978-3-642-19571-6_20 fatcat:hc7btm5r2vdsnd7qdnm6izcydy

A Hybrid Approach to Secure Function Evaluation Using SGX [article]

Joseph I. Choi, Dave 'Jing' Tian, Grant Hernandez, Christopher Patton, Benjamin Mood, Thomas Shrimpton, Kevin R. B. Butler, Patrick Traynor
2019 arXiv   pre-print
Our evaluation shows that our SGX-enabled SFE scheme enjoys a 38x increase in performance over garbled-circuit-based SFE.  ...  This approach alleviates the burden of trust on the enclave by allowing the protocol designer to choose which components should be evaluated within the enclave, and which via standard cryptographic techniques  ...  In our protocols, f 1 , f 3 will be computed within an SGX enclave, and f 2 via garbling schemes and oblivious transfer.  ... 
arXiv:1905.01233v1 fatcat:jsq22qmoj5bzraynun6fibq43y

Hybrid Approach for Secure Mobile Agent Computations [chapter]

J. Todd McDonald
2006 Lecture Notes in Computer Science  
We review and analyze methods proposed for securing agent operations in the face of passive and active adversaries by means of secure multi-party computations.  ...  Mobile agent applications are particularly vulnerable to malicious parties and thus require more stringent security measures-benefiting greatly from schemes where cryptographic protocols are utilized.  ...  and oblivious transfer.  ... 
doi:10.1007/11801412_5 fatcat:carpt5cu6zd4hegny7zurmx6pi

Private Two-Party Cluster Analysis Made Formal Scalable [article]

Xianrui Meng, Dimitrios Papadopoulos, Alina Oprea, Nikos Triandopoulos
2019 arXiv   pre-print
For example, end-to-end execution of our secure approximate protocol, over 1M 10-dimensional records, completes in 35 sec, transferring only 896KB and achieving 97.09% accuracy.  ...  The simulator also includes in the view of P2 the garbled inputs for the corresponding elements from R. • (Oblivious transfer simulation for OT ,k ) Let y ,k be the input of P2 for the circuit GC ,k (i.e  ...  garbled circuit that evaluates MinDist/MaxDist at round and cluster k.  ... 
arXiv:1904.04475v2 fatcat:mss4mujjgngbheypvv6rurb7im

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation [chapter]

Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya
2015 Lecture Notes in Computer Science  
We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties.  ...  Our starting point is Yao's garbled circuit two party protocol, together with a two-message oblivious transfer.  ...  As we'll see, this will suffice for making the simulation corruption-oblivious. Oblivious transfer.  ... 
doi:10.1007/978-3-662-46497-7_22 fatcat:4illwoapijfs7mkhi2pkdiat5a

Communication Complexity and Secure Function Evaluation [article]

Moni Naor, Kobbi Nissim
2001 arXiv   pre-print
The second methodology uses the circuit computing f, enhanced with look-up tables as its underlying computational model.  ...  In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter".  ...  Claim 3.1 P Ind AB privately computes the function Ind AB with communication costs C OT (w, k, Y ), computation costs O(W OT (w, k, Y ) ) and round complexity of the oblivious transfer protocol.  ... 
arXiv:cs/0109011v1 fatcat:fs2of35xenbyxhlpjabcmfwroe

Outsourcing computation for private function evaluation

Henry Carter, Patrick Traynor
2019 International Journal of Information and Computer Security  
As a secondary contribution, we develop a technique for combining public and private sub-circuits in a single computation called partially-circuit private (PCP) garbling.  ...  MOBILE: We define this party (these parties) as one (or more) computationally restricted device(s) that provide input to the application server and may receive some output from the computation.  ...  Once the Application server possesses the garbled circuits and has her input delivered for each via oblivious transfer, she selects a fraction of the circuits to be opened using cut-&-choose.  ... 
doi:10.1504/ijics.2019.10024485 fatcat:bbyt2wyqubg5dkpikwxqmu6u5u
« Previous Showing results 1 — 15 out of 193 results