Filters








42,886 Hits in 7.3 sec

Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC

Navneet Agarwal, Sanat Anand, Manoj Prabhakaran, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against passive  ...  a trusted party to generate correlated randomness.  ...  ), UNIMPC could be seen as a common denominator of these two secure computation models.  ... 
doi:10.4230/lipics.icalp.2018.103 dblp:conf/icalp/AgarwalAP18 fatcat:7llv6uh25bhy5o2uik56opwfw4

A Quantitative Approach to Reductions in Secure Computation [chapter]

Amos Beimel, Tal Malkin
2004 Lecture Notes in Computer Science  
We take a first step in this study, by considering the two-party, honestbut-curious, information-theoretic case. For this setting, we provide a complete characterization for deterministic protocols.  ...  However, without such a black box, not all functions can be securely computed.  ...  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

On unconditionally secure multiparty computation for realizing correlated equilibria in games

Ye Wang, Shantanu Rane, Prakash Ishwar
2013 2013 IEEE Global Conference on Signal and Information Processing  
We characterize the joint distributions that can be securely sampled by malicious players via protocols using error free communication.  ...  We characterize the joint distributions that can be securely sampled by malicious players via protocols using errorfree communication.  ...  Secure Sampling Protocols In the problem of secure two-party sampling, the objective is to design a secure interactive protocol that allows the two parties to generate correlated randomness according to  ... 
doi:10.1109/globalsip.2013.6736860 dblp:conf/globalsip/WangRI13 fatcat:72y3rjubwrdavfer4eqqlacdfu

Computational Hardness of Optimal FairComputation: Beyond Minicrypt [article]

Hemanta K. Maji, Mingyuan Wang
2021 IACR Cryptology ePrint Archive  
Secure multi-party computation allows mutually distrusting parties to compute securely over their private data.  ...  Next, our work entirely characterizes the additional power of secure function evaluation functionalities for optimal fair coin-tossing.  ...  Finally, we prove a dichotomy for two-party secure (possibly, randomized output) function evaluation functionalities.  ... 
dblp:journals/iacr/MajiW21 fatcat:cht6ua6g2fd3tar3ljftmyqeie

The All-or-Nothing Nature of Two-Party Secure Computation [chapter]

Amos Beimel, Tal Malkin, Silvio Micali
1999 Lecture Notes in Computer Science  
A function f is computationally securely computable if two computationally-bounded parties Alice, having a secret input x, and Bob, having a secret input y, can talk back and forth so that (even if one  ...  Consequently, the complexity assumptions sufficient and/or required for computationally securely computing f are the same for every non-trivial function f .  ...  A Characterization of Trivial Functions. Is there a combinatorial property that makes a two-argument function securely computable by two, possibly malicious, parties with unbounded computing power?  ... 
doi:10.1007/3-540-48405-1_6 fatcat:lr5lcaey6bfqnhacw3exo35oo4

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions [chapter]

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2015 Lecture Notes in Computer Science  
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output.  ...  Our main result in this work is a complete characterization of the ( symmetric) Boolean functions that can be computed with fairness in the two-party setting; this settles an open problem of Gordon et  ...  Characterization of Fairness for Boolean Two-Party Functions In this section we provide a complete characterization of the Boolean functions that can be computed with full security.  ... 
doi:10.1007/978-3-662-46494-6_10 fatcat:bbt3g64ffndsnbtoz57gosjmca

On Unconditionally Secure Multiparty Computation for Realizing Correlated Equilibria in Games [article]

Ye Wang, Shantanu Rane, Prakash Ishwar
2013 arXiv   pre-print
In applying sampling protocols toward attaining correlated equilibria with rational players, we observe that security against malicious parties may be much stronger than necessary.  ...  We characterize the joint distributions that can be securely sampled by malicious players via protocols using error-free communication.  ...  Secure Sampling Protocols In the problem of secure two-party sampling, the objective is to design a secure interactive protocol that allows the two parties to generate correlated randomness according to  ... 
arXiv:1311.1490v1 fatcat:jvaioogytbcl5eozedkxyflhhq

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols [chapter]

Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek
2011 Lecture Notes in Computer Science  
In 2-party secure computation, access to common, trusted randomness is a fundamental primitive.  ...  We show that a source of common randomness does not add any additional power for secure evaluation of deterministic functions, even when one of the parties has arbitrary influence over the distribution  ...  We show: -For two-party secure function evaluation (SFE) of deterministic functions, being given a source of common randomness is useless, irrespective of any computational complexity assumptions, when  ... 
doi:10.1007/978-3-642-19571-6_29 fatcat:ghmfbch2qjenxk4ywfparez3pi

Assisted Common Information with Applications to Secure Two-Party Computation [article]

Vinod Prabhakaran, Manoj Prabhakaran
2010 arXiv   pre-print
Secure multi-party computation is a central problem in modern cryptography.  ...  The key tool we develop is a generalization of the concept of common information of two dependent random variables [Gacs-Korner, 1973].  ...  Roughly, the goal of secure multi-party computation is to carry out computations on inputs distributed among two (or more) parties, so as to provide each of them with no more information than what their  ... 
arXiv:1002.1916v1 fatcat:aojxgtoer5as5beu6q4sn7phgy

Limits on the Usefulness of Random Oracles [chapter]

Iftach Haitner, Eran Omri, Hila Zarosim
2013 Lecture Notes in Computer Science  
We make progress towards answering this question, showing that essentially, any no private input, semi-honest two-party functionality that can be securely implemented in the random oracle model, can be  ...  In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbounded computational power  ...  Putting the two results together, gives a partial characterization of the power of the random-oracle model for (semi-honest) two-party computation.  ... 
doi:10.1007/978-3-642-36594-2_25 fatcat:rnzw32qlandanjmbrzsvvrddxq

Practical Private Information Aggregation in Large Networks [chapter]

Gunnar Kreitz, Mads Dam, Douglas Wikström
2012 Lecture Notes in Computer Science  
We present efficient and scalable protocols for privately computing a large range of aggregation functions based on addition, disjunction, and max/min.  ...  For addition, we give a protocol that is informationtheoretically secure against a passive adversary, and which requires only one additional round compared to non-private protocols for computing sums.  ...  A natural path towards a solution is to use multi-party computation (MPC) techniques, which have been long studied within the field of cryptography.  ... 
doi:10.1007/978-3-642-27937-9_7 fatcat:rp4k3srleze65n45kmb7tiq7ke

Towards Characterizing Complete Fairness in Secure Two-Party Computation [chapter]

Gilad Asharov
2014 Lecture Notes in Computer Science  
This raises the fundamental question of characterizing complete fairness in secure two-party computation.  ...  Since then, the accepted belief has been that nothing non-trivial can be computed with complete fairness in the two party setting.  ...  See [16] for a survey of fairness in secure computation). Open Problems. Our work is an important step towards a full characterization of fairness of finite domain functions.  ... 
doi:10.1007/978-3-642-54242-8_13 fatcat:gepsycxbpjcxbdxl5q6asjnwpu

Improved single-round secure multiplication using regenerating codes [article]

Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing
2021 IACR Cryptology ePrint Archive  
Our protocol is secure against the maximal adversary corrupting t < n/2 parties. All existing approaches in this setting have complexity Ω(n 2 ).  ...  Immediately it seemed like an application to improve the complexity of unconditionally secure multiparty computation must be imminent; however, thus far, no result has been published.  ...  Secure parallel computation Let f be a function represented by an arithmetic circuit over S.  ... 
dblp:journals/iacr/AbspoelC0DX21 fatcat:lszrm4eiyvapvcpihymth6egne

On the Communication Complexity of Secure Computation [chapter]

Deepesh Data, Manoj M. Prabhakaran, Vinod M. Prabhakaran
2014 Lecture Notes in Computer Science  
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive.  ...  Also, we obtain the first explicit example of a function that incurs a higher communication cost than the input length in the secure computation model of Feige, Kilian and Naor [17] , who had shown that  ...  For 2-party secure computation with security against passive corruption of one party (when the function admits such a protocol), communication complexity was combinatorially characterized in [31] .  ... 
doi:10.1007/978-3-662-44381-1_12 fatcat:zr2xvjjqcvepdmndfnpx4bmrsu

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols [chapter]

Vipul Goyal, Ilya Mironov, Omkant Pandey, Amit Sahai
2013 Lecture Notes in Computer Science  
Our work obtains general upper bounds on accuracy for differentially private two-party protocols computing any Boolean function.  ...  In particular, we show tight results on the accuracy that is achievable for the AND and XOR functions in the two-party setting, completely characterizing which accuracies are achievable for any given level  ...  We then formulate necessary conditions for existence of a differentially private two-party protocol implementing a randomized two-party Boolean functionality (Section 3.1), and use these conditions towards  ... 
doi:10.1007/978-3-642-40041-4_17 fatcat:lcdc2d26snhmffyc727qukprda
« Previous Showing results 1 — 15 out of 42,886 results