Filters








2,043 Hits in 3.9 sec

General Adversaries in Unconditional Multi-party Computation [chapter]

Matthias Fitzi, Martin Hirt, Ueli Maurer
1999 Lecture Notes in Computer Science  
We consider a generalized adversary model for unconditionally secure multi-party computation.  ...  completely the adversary structures for which unconditionally secure multi-party computation is possible, for four di erent models: Perfect security with and without broadcast, and unconditional security  ...  A general approach to multi-party computation is to construct protocols for arbitrary speci cations, or, more generally, to nd a function (called multi-party protocol generator) that takes a speci cation  ... 
doi:10.1007/978-3-540-48000-6_19 fatcat:lfhfevikozgobj7xrdavdviohy

Trading correctness for privacy in unconditional multi-party computation [chapter]

Matthias Fitzi, Martin Hirt, Ueli Maurer
1998 Lecture Notes in Computer Science  
The classical results in multi-party computation are for the special cases of only passive (ta = t f = 0) or only active (tp = t f = 0) corruption.  ...  This paper improves on the classical results in unconditionally secure multi-party computation among a set of n players, by considering a model with three simultaneously occurring types of player corruption  ...  The classical results in unconditional multi-party computation are special cases of the mixed model.  ... 
doi:10.1007/bfb0055724 fatcat:x7kmzt7xdfdijeymfgn65bfbca

Page 2848 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
unconditional multi-party computation.  ...  Summary: “We consider a generalized adversary model for un- conditionally secure multi-party computation.  ... 

Multi-party Computation with Hybrid Security [chapter]

Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger
2004 Lecture Notes in Computer Science  
As one particular implication of this general result, we show that multi-party computation computationally secure against T < n/2 actively corrupted players (which is optimal) can additionally guarantee  ...  For an even more general model involving three different thresholds tp, tσ, and T , we give tight bounds for the achievability of multi-party computation.  ...  Introduction Secure distributed cooperation among mutually distrusting players can be achieved by means of general multi-party computation (MPC).  ... 
doi:10.1007/978-3-540-24676-3_25 fatcat:dad6pn4fw5e4ldb6pooya3v7fm

(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks [article]

Shailesh Vaya
2010 arXiv   pre-print
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties.  ...  We consider the problem of (unconditional) secure multi-party computation when 'some' of the communication channels connecting the parties can be corrupted passively as well as actively.  ...  We give results for this new model, called (Unconditional) secure multi-party computation with manin-the-middle attacks, in a.e.s.c. framework.  ... 
arXiv:1005.5020v1 fatcat:m5nqjnvfrzhubcaqd7xc67b5u4

Unconditionally secure multi-party quantum commitment scheme

Ming-Qiang Wang, Xue Wang, Tao Zhan
2017 Quantum Information Processing  
Multi-party means that there are more than one recipient in our scheme. We show that our quantum commitment scheme is unconditional hiding and binding, and hiding is perfect.  ...  A new unconditionally secure multi-party quantum commitment is proposed in this paper by encoding the committed message to the phase of a quantum state.  ...  Unconditional hiding: for any computationally unlimited adversary A and m ∈ M, the following probability is declining exponentially in terms of the length of the QC |Pr[m ← A(1 λ , C) : (C, u) ← Com(1  ... 
doi:10.1007/s11128-017-1804-7 fatcat:2mntu7hyavfkhhjfqg5np3dyk4

Function-Dependent Commitments for Verifiable Multi-party Computation [chapter]

Lucas Schabhüser, Denis Butin, Denise Demirel, Johannes Buchmann
2018 Lecture Notes in Computer Science  
As an example, we introduce a verifiable multi-party computation scheme for shared data providing public verifiability and unconditional privacy towards the servers and parties verifying the correctness  ...  Thus, our solution improves the state of the art for authenticated computing, verifiable computing and multi-party computation.  ...  A verifiable computing scheme VC provides unconditional input privacy if any computationally unbounded adversary A has Adv In−Privacy Server A (VC, f, λ, t) = 0.  ... 
doi:10.1007/978-3-319-99136-8_16 fatcat:2lju7ph5pvactfbo4rwrskxeim

Secure secret reconstruction and multi-secret sharing schemes with unconditional security

Lein Harn
2013 Security and Communication Networks  
In this paper, we will introduce the security problem that an adversary can obtain the secret when there are more than t participants in Shamir's secret reconstruction.  ...  A secure secret reconstruction scheme, which prevents the adversary from obtaining the secret is proposed.  ...  Unconditional security means that the security holds even if the adversary has unbounded computing power.  ... 
doi:10.1002/sec.758 fatcat:fz3pij4rvbg5dh2xggzabscjzu

Robustness for Free in Unconditional Multi-party Computation [chapter]

Martin Hirt, Ueli Maurer
2001 Lecture Notes in Computer Science  
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary.  ...  Recently, Hirt, Maurer, and Przydatek [HMP00] proposed a new protocol for perfectly secure multi-party computation with considerably better communication complexity than previous protocols: A set of n  ...  Introduction Secure multi-party computation Secure multi-party computation (MPC), as introduced by Yao [Yao82] , allows a set of n players to compute an arbitrary agreed function of their private inputs  ... 
doi:10.1007/3-540-44647-8_6 fatcat:ooog6g3kujb3dopway6abdgx7y

Efficient Secure Multi-party Computation [chapter]

Martin Hirt, Ueli Maurer, Bartosz Przydatek
2000 Lecture Notes in Computer Science  
Furthermore, we show that a sub-protocol proposed in [GRR98] for improving the efficiency of unconditionally secure multi-party computation is insecure.  ...  In this paper, we propose a perfectly secure multi-party protocol which requires communicating O(n 3 ) field elements per multiplication.  ...  Outline In Sect. 2 we introduce the general framework for efficient resilient protocols. This framework is not specific for multi-party computation.  ... 
doi:10.1007/3-540-44448-3_12 fatcat:6cnw5u2bd5fhrg4v6wyicyy3u4

Batch-verifiable Secret Sharing with Unconditional Privacy

Stephan Krenn, Thomas Lorünser, Christoph Striecks
2017 Proceedings of the 3rd International Conference on Information Systems Security and Privacy  
Unconditionally private schemes information-theoretically guarantee privacy even against computationally unbounded adversaries and, hence, can be seen to be private in a long-term sense.  ...  ., in distributed computing scenarios, and verifiable secret sharing schemes with unconditional privacy (but without a batching feature) exist for a long time, e.g., Ben-Or, Goldwasser, and Wigderson (  ...  Fundamentally, secret sharing is used as a building block in many cryptographic areas, such as within secure multi-party computation (e.g., (Chaum et al., 1987) ) or broadcast encryption (e.g., (Naor  ... 
doi:10.5220/0006133003030311 dblp:conf/icissp/KrennLS17 fatcat:whye3m44ybbtha4djkrtwfpxx4

Page 6506 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
Summary: “We present a very efficient multi-party computation protocol unconditionally secure against an active adversary.  ...  {For the entire collection see MR 2003d:94001.} 2003h:94039 94A60 68P25 Hirt, Martin (CH-ETHZ-C; Ziirich) ; Maurer, Ueli (CH-ETHZ-C; Ziirich) Robustness for free in unconditional multi-party computation  ... 

Detectable byzantine agreement secure against faulty majorities

Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
2002 Proceedings of the twenty-first annual symposium on Principles of distributed computing - PODC '02  
• 'Unconditional' security -Adversary has unbounded computational power -Assume secure channels between honest players Theorem ( [CFGN'96] , "non-committing encryption"): Unconditional security Computational  ...  "Multi-party Computing" (in the paper) • Conclusions, Open questions 23 Desynchronized clocks • What if -Players don't start at the same time?  ... 
doi:10.1145/571825.571841 dblp:conf/podc/FitziGHHS02 fatcat:sns2v6qhlzedvdhr6v2pg5trdi

Detectable byzantine agreement secure against faulty majorities

Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
2002 Proceedings of the twenty-first annual symposium on Principles of distributed computing - PODC '02  
• 'Unconditional' security -Adversary has unbounded computational power -Assume secure channels between honest players Theorem ( [CFGN'96] , "non-committing encryption"): Unconditional security Computational  ...  "Multi-party Computing" (in the paper) • Conclusions, Open questions 23 Desynchronized clocks • What if -Players don't start at the same time?  ... 
doi:10.1145/571836.571841 fatcat:253jywrpsrck3iuqaky6alacae

Secure Physical Computation Using Disposable Circuits [chapter]

Ben A. Fisch, Daniel Freund, Moni Naor
2015 Lecture Notes in Computer Science  
Moreover, our result generalizes to any multi-party physical computation. Formally, our protocols achieve unconditional UC-security with input-dependent abort.  ...  In a secure physical computation, a set of parties each have physical inputs and jointly compute a function of their inputs in a way that reveals no information to any party except for the output of the  ...  We conclude that REAL π,A,Z ∼ IDEAL F IDA Physical2P C ,S,Z Secure Physical Multi-Party Computation Our protocol for secure physical 2PC can be generalized for n parties computing a multi-party functionality  ... 
doi:10.1007/978-3-662-46494-6_9 fatcat:4xbamc5jujdhfa5r2liv7qc6ia
« Previous Showing results 1 — 15 out of 2,043 results