A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Round-Optimal Black-Box Two-Party Computation
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
In [Eurocrypt 2004] Katz and Ostrovsky establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. ...
Plugging a parallel version of our oblivious transfer into the blackbox non-interactive secure computation protocol of [IKO + 11] we obtain the first round-optimal black-box two-party protocol in the plain ...
Namely, Can we construct a round-optimal fully black-box protocol for two-party computation based on general assumptions? Black-box round-optimal two-party computation? ...
doi:10.1007/978-3-662-48000-7_17
fatcat:txyvfmcx5zdevjdqolxk4ezbba
Separating Two-Round Secure Computation From Oblivious Transfer
2020
Innovations in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
for the difficulty of ruling out black-box constructions of 3-round MPC from 2-round OT, and separate a relaxed "non-compact" variant of 2-party homomorphic secret sharing from 2-round OT. ...
These constructions made a novel non-black-box use of the underlying OT protocol. The question remained whether this can be done by only making black-box use of 2-round OT. ...
It additionally requires the parties to make a black-box use of any pseudorandom generator (PRG). Theorem 1 (Round-optimal 2PC [54] ). ...
doi:10.4230/lipics.itcs.2020.71
dblp:conf/innovations/ApplebaumBGIS20
fatcat:2rnasclhbnhqnlhiyytadlvqfq
On the Black-Box Complexity of Optimally-Fair Coin Tossing
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Let Π be a black-box construction for two-party optimally-fair coin tossing based on one-way functions with input and output length n. ...
An important corollary of this is that it is impossible to construct an optimally-fair coin tossing protocol via a black-box construction from one-way functions whose round complexity is independent of ...
There are actually several flavors of black-box reductions (fully black-box, semi black-box and weakly black-box [rtv04] ). ...
doi:10.1007/978-3-642-19571-6_27
fatcat:5cvqyh7vvbgq7prdevu4ny6uf4
Round-Optimal Secure Two-Party Computation
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Here, we establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. ...
We consider the central cryptographic task of secure twoparty computation: two parties wish to compute some function of their private inputs (each receiving possibly different outputs) where security should ...
Lower bounds on the round-complexity of secure two-party computation with respect to black-box 1 proofs of security have also been given. ( We comment further on black-box bounds in Section 1.2.) ...
doi:10.1007/978-3-540-28628-8_21
fatcat:cp57afc7ijd7teis6zqmhwxl4u
Specifying sharemind's arithmetic black box
2013
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies - PETShop '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we discuss the design choices and initial experiences with a domain-specific language and its optimizing compiler for specifying protocols for secure computation. ...
ACKNOWLEDGEMENTS This work was supported by the European Social Fund through the ICT Doctoral School programme, and by the European Regional Development Fund through the Estonian Center of Excellence in Computer ...
We see that this protocol requires two rounds, because there are paths in this graph that contain two solid edges. The intermediate representation is used to optimize the protocols. ...
doi:10.1145/2517872.2517874
dblp:conf/ccs/LaudPPR13
fatcat:exc2banu4zcsjiwhjbwhf27kwe
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting ...
[TCC'11] took a step toward answering this question by showing that any black-box construction of optimallyfair coin tossing based on a one-way functions with n-bit input and output needs Ω(n/ log n) rounds ...
There are actually several flavors of black-box reductions (fully black-box, semi black-box and weakly black-box [RTV04] ). ...
doi:10.1007/978-3-642-54242-8_10
fatcat:uqyrauwvhfaalay7hc5irbmhzu
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. ...
Our protocol withstands an active, adaptive adversary corrupting a minority of the parties. ...
Recently, Katz and Ostrovsky obtained a two-party protocol with an optimal exact round complexity [25] . ...
doi:10.1007/11535218_23
fatcat:uufcox6brfcqlddcjsfwn5o7sm
Page 5086 of Mathematical Reviews Vol. , Issue 93i
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This schematic algorithm uses a ‘black-box’ pro- cedure for communication, the output of which must meet two requirements: a global-order requirement and a deadlock-free re- quirement. ...
The implementation of the black- box procedure in these models enables us to translate existing algorithms between the two models whenever these algorithms are based on the schematic algorithm. ...
Secure Multiparty RAM Computation in Constant Rounds
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we consider the multi-party case and obtain the following results: -Semi-honest model : We present a constant-round black-box secure computation protocol for RAM programs. ...
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 ...
This changed for the two-party setting with the recent results on garbled RAM [32, 14, 12] and its black-box variant [11] . 3 However, these round-efficient results are limited to the two-party setting ...
doi:10.1007/978-3-662-53641-4_19
fatcat:bpeqitkgqjdlraijgclxx62hdy
A Quantitative Approach to Reductions in Secure Computation
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
However, without such a black box, not all functions can be securely computed. ...
This gives rise to two types of functions, those that can be computed without a black box ("easy") and those that cannot ("hard"). However, no further distinction among the hard functions is made. ...
We are also grateful to AT&T Labs-Research that hosted us for two weeks and for three years, respectively, during which part of this research was conducted. ...
doi:10.1007/978-3-540-24638-1_14
fatcat:khnh525o6vhrzfyg5nkceqg4fe
Private multiparty sampling and approximation of vector combinations
2009
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Moreover, these results have some interesting consequences for the general problem of reducing sublinear-communication secure multiparty computation to two-party private information retrieval (PIR). ...
The parties want to minimize communication and local computation while guaranteeing privacy in the sense that no party learns more than necessary. ...
The protocol uses two-party OT in a black-box manner, has local computation complexity of NM O(1) , communication M O(1) , and round complexity O(1). ...
doi:10.1016/j.tcs.2008.12.062
fatcat:cmt6mwibyjen7ogguojyrdkfh4
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
. • Black-box use of group. ...
We modify the succinct protocols of Boyle et al. so that they only make a black-box use of the underlying group, eliminating an expensive non-black-box setup phase. • Round complexity. ...
Black-box use of group. ...
doi:10.1007/978-3-319-56614-6_6
fatcat:bhgipsvgsvd53caixzg45iybem
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Non-black-box techniques require parties to prove in zero-knowledge, statements that involve the computation of the underlying primitives. ...
Our protocols are round and communication efficient, and use the underlying cryptographic primitives in a black-box way. ...
It is not clear how to extend our two-party protocol to the multiparty case while preserving the important features such as round and communication efficiency and/or the black-box use of the underlying ...
doi:10.1007/978-3-642-13708-2_15
fatcat:zrp7qxsdgbdsxmzmylxhfzdzum
Responsive Round Complexity and Concurrent Zero-Knowledge
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The new protocol is a black-box concurrent zero knowledge proof for all languages in NP with round complexityÕ(log 2 n) but responsive round complexitỹ O(log n). ...
Furthermore, in light of the known lower bounds, the responsive round complexity of this protocol is basically optimal. ...
In this paper, we concentrate on black-box computational zero-knowledge, and use zero-knowledge as shorthand for black-box computational zero-knowledge. ...
doi:10.1007/3-540-45682-1_25
fatcat:xrljgk4zr5buzbpjf6cxlbq63a
A framework for analyzing RFID distance bounding protocols
2011
Journal of Computer Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
It thus introduces some new concepts in the distance bounding domain as the black-box and white-box models, and the relation between the frauds with respect to these models. ...
A man-in-the-middle (MITM) is a form of attack, where the adversary provokes or manipulates the communication between two parties. ...
In this analysis, we consider both black-box and white-box prover model and we compute the success probabilities of each fraud. ...
doi:10.3233/jcs-2010-0408
fatcat:fz272dd3ljcnhdwmqvzezjplhm
« Previous
Showing results 1 — 15 out of 19,992 results