Filters








314 Hits in 3.8 sec

Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation [chapter]

Ran Cohen, Yehuda Lindell
2014 Lecture Notes in Computer Science  
In this paper, we initiate a study of the relation between fairness and guaranteed output delivery in secure multiparty computation.  ...  In the setting of secure multiparty computation, a set of parties wish to compute a joint function of their private inputs.  ...  Fairness versus Guaranteed Output Delivery The two notions of fairness and of guaranteed output delivery are quite similar and are often interchanged.  ... 
doi:10.1007/978-3-662-45608-8_25 fatcat:szt446lbvjc23pgnhckxsucani

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation

Ran Cohen, Yehuda Lindell
2016 Journal of Cryptology  
In this paper, we initiate a study of the relation between fairness and guaranteed output delivery in secure multiparty computation.  ...  In the setting of secure multiparty computation, a set of parties wish to compute a joint function of their private inputs.  ...  Fairness versus Guaranteed Output Delivery The two notions of fairness and of guaranteed output delivery are quite similar and are often interchanged.  ... 
doi:10.1007/s00145-016-9245-5 fatcat:mmzum4wfmjbtrfxuflqkm52kx4

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation [chapter]

Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2006 Lecture Notes in Computer Science  
Secure protocols for the case of an honest majority achieve full security and thus output delivery and fairness are guaranteed.  ...  The typical security properties considered are privacy, correctness, independence of inputs, guaranteed output delivery and fairness.  ...  In the full version of the paper we prove Theorem 4 using a two-phase functionality, which roughly corresponds to the task of committing to a secret and later decommitting it.  ... 
doi:10.1007/11818175_29 fatcat:wp3itzqmyfdifg2o2sw67puabi

How to Use Bitcoin to Design Fair Protocols [chapter]

Iddo Bentov, Ranjit Kumaresan
2014 Lecture Notes in Computer Science  
Guaranteed output delivery ensures that an adversary cannot prevent the honest parties from computing the function. Fairness in standard secure computation.  ...  Fairness guarantees that if one party receives output then all parties receive output.  ...  such as guaranteed output delivery or fairness. 1 Addressing this deficiency is critical if secure computation is to be widely adopted in practice, especially given the current interest in practical  ... 
doi:10.1007/978-3-662-44381-1_24 fatcat:tkhrhni6lfa5xmedvsi7v6h3my

Information-theoretically secure protocols and security under composition

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2006 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06  
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent  ...  ., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs).  ...  This is called "rushing". 5 In the asynchronous stand-alone model of secure computation, output delivery and fairness are guaranteed to some extent.  ... 
doi:10.1145/1132516.1132532 dblp:conf/stoc/KushilevitzLR06 fatcat:yvuly6h5obbu3alwbxygt2gwqa

Information-Theoretically Secure Protocols and Security under Composition

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2010 SIAM journal on computing (Print)  
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent  ...  ., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs).  ...  This is called "rushing". 5 In the asynchronous stand-alone model of secure computation, output delivery and fairness are guaranteed to some extent.  ... 
doi:10.1137/090755886 fatcat:vqap7ivuizfapowlalyju5sdlm

Secure Computation Without Authentication

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2010 Journal of Cryptology  
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs.  ...  In this model, it is not possible to achieve the same level of security as in the authenticated-channel setting. Nevertheless, we show that meaningful security guarantees can be provided.  ...  In particular, this means that no honest majority is assumed (and therefore fairness and output delivery are not guaranteed, as is standard for this setting).  ... 
doi:10.1007/s00145-010-9075-9 fatcat:tauep6n2l5arznefrlw4lpr37e

Secure Computation Without Authentication [chapter]

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2005 Lecture Notes in Computer Science  
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs.  ...  In this model, it is not possible to achieve the same level of security as in the authenticated-channel setting. Nevertheless, we show that meaningful security guarantees can be provided.  ...  In particular, this means that no honest majority is assumed (and therefore fairness and output delivery are not guaranteed, as is standard for this setting).  ... 
doi:10.1007/11535218_22 fatcat:oqgl7ju5prbahlunail2kfs2zy

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Yonatan Aumann, Yehuda Lindell
2009 Journal of Cryptology  
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs.  ...  In the setting of secure multiparty computation, a set of parties with private inputs wish to jointly compute some functionality of their inputs.  ...  One technical detail that arises when considering the setting of no honest majority is that it is impossible to achieve fairness or guaranteed output delivery.  ... 
doi:10.1007/s00145-009-9040-7 fatcat:eimnsgjfxvaktidgjyovm3bzcy

Secure Multiparty Computation from SGX [chapter]

Raad Bahmani, Manuel Barbosa, Ferdinand Brasser, Bernardo Portela, Ahmad-Reza Sadeghi, Guillaume Scerri, Bogdan Warinschi
2017 Lecture Notes in Computer Science  
In this paper we show how IEEs provide a new path to constructing general secure multiparty computation (MPC) protocols.  ...  Our results Generic secure multiparty computation. The main result of the paper is a highly efficient protocol for the secure multiparty computation of an arbitrary reactive functionality F .  ...  As is customary in secure computation models, we take the ideal world versus real world approach.  ... 
doi:10.1007/978-3-319-70972-7_27 fatcat:wunetkom2fbatjfy4ebzadb2d4

Multiparty Computation, an Introduction [chapter]

Ronald Cramer, Ivan Damgård
2005 Contemporary Cryptology  
secure multiparty computation.  ...  These lecture notes introduce the notion of secure multiparty computation.  ...  The MPC and VSS Problems Secure multiparty computation (MPC) can be defined as the problem of n players to compute an agreed function of their inputs in a secure way, where security means guaranteeing  ... 
doi:10.1007/3-7643-7394-6_2 fatcat:o6zvvsl475et7pnvwiir3o6d2u

An operational architecture for privacy-by-design in public service applications [article]

Prashant Agrawal, Anubhutie Singh, Malavika Raghavan, Subodh Sharma, Subhashis Banerjee
2020 arXiv   pre-print
While a rich set of special-purpose privacy-preserving techniques exist in computer science, they are unable to provide end-to-end protection in alignment with legal principles in the absence of an overarching  ...  Governments around the world are trying to build large data registries for effective delivery of a variety of public services.  ...  Secure multiparty computation Secure multiparty computation (SMC) -originally pioneered by Yao through his garbled circuits technique [85] -allows multiple parties to compute a function of their private  ... 
arXiv:2006.04654v1 fatcat:7ujirigb7ngr7hoga4edcmdpiy

Videoconferencing over packet-based networks

M.H. Willebeek-LeMair, Zon-Yin Shae
1997 IEEE Journal on Selected Areas in Communications  
In this paper, we present one such packet-based approach, the Multimedia Multiparty Teleconferencing (MMT) system, which was fully implemented as a research prototype.  ...  These network technologies differ in terms of bandwidth usage and availability, connection versus connectionless communication paradigms, jitter, latency, packet-loss (error) characteristics, etc.  ...  However, RTP itself does not provide any mechanisms to provide quality of service guarantees or real-time delivery.  ... 
doi:10.1109/49.611162 fatcat:ml7ypz2infhirnaolcr3ckozni

Foundations of Programmable Secure Computation

Sven Laur, Pille Pullonen-Raudvere
2021 Cryptography  
This paper formalises the security of programmable secure computation focusing on simplifying security proofs of new algorithms for existing computation frameworks.  ...  We establish various preconditions that are satisfied by natural secure computation frameworks and protocols, thus showing that mostly the intuitive proofs suffice.  ...  Programmable Multiparty Computation Most platforms for multiparty computations, see, e.g., in [1, 2, 4] , consist of a secure storage and a system of primitive protocols operating on top of the storage  ... 
doi:10.3390/cryptography5030022 fatcat:tpob4csqzrb5ddgeyv5sod5t5y

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries [chapter]

Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof
2018 Lecture Notes in Computer Science  
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output.  ...  As with previous works in this area aiming to achieve high efficiency, our protocol is secure with abort and does not achieve fairness, meaning that the adversary may receive output while the honest parties  ...  In some cases, fairness and guaranteed output delivery are not required, in which case we say that the protocol is secure with abort.  ... 
doi:10.1007/978-3-319-96878-0_2 fatcat:55tehzjfi5h3ba5ot5ckt5fj7a
« Previous Showing results 1 — 15 out of 314 results