Filters








183 Hits in 4.9 sec

Protocols for Multiparty Coin Toss with Dishonest Majority [chapter]

Amos Beimel, Eran Omri, Ilan Orlov
2010 Lecture Notes in Computer Science  
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols.  ...  Specifically, for a constant number of parties or when the number of malicious parties is somewhat larger than half, we present an r-round m-party coin-tossing protocol with optimal bias of O(1/r).  ...  We are grateful to Yehuda Lindell for many helpful discussions and great advice. We thank Oded Goldreich and Gil Segev for suggesting this problem and for useful conversations.  ... 
doi:10.1007/978-3-642-14623-7_29 fatcat:5r6wm4o2pbfcnbg3ji55n4lf3i

Protocols for Multiparty Coin Toss with a Dishonest Majority

Amos Beimel, Eran Omri, Ilan Orlov
2013 Journal of Cryptology  
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols.  ...  Specifically, for a constant number of parties or when the number of malicious parties is somewhat larger than half, we present an r-round m-party coin-tossing protocol with optimal bias of O(1/r).  ...  We are grateful to Yehuda Lindell for many helpful discussions and great advice. We thank Oded Goldreich and Gil Segev for suggesting this problem and for useful conversations.  ... 
doi:10.1007/s00145-013-9168-3 fatcat:2s5cqxswkzazfhgsevmmb2hwlm

Fair and Efficient Secure Multiparty Computation with Reputation Systems [chapter]

Gilad Asharov, Yehuda Lindell, Hila Zarosim
2013 Lecture Notes in Computer Science  
This can be preferable to the current situation where either an honest majority is arbitrarily assumed, or a protocol that is secure for a dishonest majority is used and the efficiency and security guarantees  ...  Moreover, it is known that there exist no protocols that simultaneously achieve full security for the case of honest majority, and security-with-abort (i.e., without fairness) when there is no honest majority  ...  securely computes the multiparty coin-tossing functionality F = {f m(n) CT } n∈N with respect to (m(·), Rep).  ... 
doi:10.1007/978-3-642-42045-0_11 fatcat:owz52zsusrdp3ocnmpatyyaniu

Quantum Communication Networks and Trust Management: A Survey

Shibin Zhang, Yan Chang, Lili Yan, Zhiwei Sheng, Fan Yang, Guihua Han, Yuanyuan Huang, Jinyue Xia
2019 Computers Materials & Continua  
J. (2013): Improved secure multiparty computation with a dishonest majority via quantum means. Li, X. L.; Nie, L.  ...  toss), QOT (Quantum oblivious transfer), SMQC (Secure multiparty quantum computation) and so on, one of the most studied is QKD.  ...  In 2011, Liu et al. proposed a novel quantum coin tossing protocol with computational security [Liu and Cao (2011) ].  ... 
doi:10.32604/cmc.2019.05668 fatcat:74ltvvnre5bhzpsim3vdpebo4a

Measurement-device-independent quantum coin tossing

Liangyuan Zhao, Zhenqiang Yin, Shuang Wang, Wei Chen, Hua Chen, Guangcan Guo, Zhengfu Han
2015 Physical Review A. Atomic, Molecular, and Optical Physics  
Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest.  ...  However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice, which will possibly make the protocol completely insecure.  ...  It is the quantum counterpart of classical coin tossing first introduced by Blum [1] in 1981. QCT can be used as a primitive in many applications, such as secure multiparty computation.  ... 
doi:10.1103/physreva.92.062327 fatcat:rqyecpyjibgnjaqfanf7e4xunm

Leakage-Resilient Coin Tossing [chapter]

Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai
2011 Lecture Notes in Computer Science  
In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common perfectly unbiased coins follow from general completeness theorems on multiparty secure protocols  ...  Abstract The ability to collectively toss a common coin among n parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols.  ...  Unbiased Coin Tossing with Leakage In this section, we construct our final leakage-resilient coin tossing protocol, as characterized by Definition 3.1.  ... 
doi:10.1007/978-3-642-24100-0_16 fatcat:tbdyurs2gbbsjcvqd6wcrsnoqy

Leakage-resilient coin tossing

Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai
2014 Distributed computing  
In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common perfectly unbiased coins follow from general completeness theorems on multiparty secure protocols  ...  The ability to collectively toss a common coin among n parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols.  ...  Unbiased Coin Tossing with Leakage In this section, we construct our final leakage-resilient coin tossing protocol, as characterized by Definition 3.1.  ... 
doi:10.1007/s00446-013-0206-z fatcat:tgcwsevzfrdvtgqtgitamlhwku

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol

Iftach Haitner, Eliad Tsfadia
2017 SIAM journal on computing (Print)  
For more than two decades, the best known coin-flipping protocols against dishonest majority had bias Θ( √ m ), where is the number of corrupted parties.  ...  We make a step towards eliminating the above gap, presenting an m-round, three-party coin-flipping protocol, with bias O(log 2 m) m .  ...  Assuming one-way functions exist, Cleve [13] showed that a simple m-round majority protocol can be used to derive a t-party coin-flipping protocol with bias Θ( √ m ) (against dishonest majority), where  ... 
doi:10.1137/15m1009147 fatcat:rgtyzkmlzfetrickqgeemnqoqi

An almost-optimally fair three-party coin-flipping protocol

Iftach Haitner, Eliad Tsfadia
2014 Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14  
For more than two decades, the best known coin-flipping protocols against dishonest majority had bias Θ( √ m ), where is the number of corrupted parties.  ...  We make a step towards eliminating the above gap, presenting an m-round, three-party coin-flipping protocol, with bias O(log 2 m) m .  ...  Assuming one-way functions exist, Cleve [13] showed that a simple m-round majority protocol can be used to derive a t-party coin-flipping protocol with bias Θ( √ m ) (against dishonest majority), where  ... 
doi:10.1145/2591796.2591842 dblp:conf/stoc/HaitnerT14 fatcat:bjtqlvtvcbbqbamdmoos4ctfwy

An Incentive-Compatible Smart Contract for Decentralized Commerce [article]

Nikolaj Ignatieff Schwartzbach
2020 arXiv   pre-print
By relaxing the security notion, we can replace the arbiter by a random coin toss.  ...  Finally, we show how to generalize the contract to multiparty transactions in a way that amortizes the transaction fees.  ...  the arbiter to the coin toss protocol.  ... 
arXiv:2008.10326v1 fatcat:f3sgdemkxzh2datybd3kargchq

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds [chapter]

Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
2011 Lecture Notes in Computer Science  
Gordon and Katz ask whether their results can be extended to multiparty protocols. We study 1/p-secure protocols in the multiparty setting for general functionalities.  ...  We further motivate our results by constructing protocols with stronger guarantees: If in the execution of the protocol there is a majority of honest parties, then our protocols provide full security.  ...  This goes on either until the protocol succeeds or there is an honest majority and a fully secure protocol computing f n is executed. Comparison with the multiparty coin-tossing protocol of [3] .  ... 
doi:10.1007/978-3-642-22792-9_16 fatcat:x46quk7povbjvhtkileictqlui

Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort [article]

Carsten Baum, Bernardo David, Rafael Dowsley
2018 IACR Cryptology ePrint Archive  
Fairness in Secure Multiparty Computation (MPC) is known to be impossible to achieve in the presence of a dishonest majority.  ...  Previous works have proposed combining MPC protocols with Cryptocurrencies in order to financially punish aborting adversaries, providing an incentive for parties to honestly follow the protocol.  ...  Acknowledgements This work has been supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister's Office  ... 
dblp:journals/iacr/BaumDD18 fatcat:bqliiwbugzau5b3yzulzs5uygy

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation [article]

Siddharth Garg, Zahra Ghodsi, Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
2018 arXiv   pre-print
In this work, we propose an actively secure protocol for outsourcing secure and private machine learning computations.  ...  ') parties who can deviate from the protocol.  ...  obtained from the coin tossing oracle for the outer protocol.  ... 
arXiv:1812.01372v1 fatcat:tdxijdfz2vei3hefs2lolyubyq

Distributed Quantum Computing [chapter]

Harry Buhrman, Hein Röhrig
2003 Lecture Notes in Computer Science  
Quantum computing combines the framework of quantum mechanics with that of computer science.  ...  have been shown to be impossible, but there are protocols for coin tossing with constant bias.  ...  The best known impossibility bound for strong coin tossing matches the bias of the best known protocol for weak coin tossing -it is not clear whether this is a coincidence.  ... 
doi:10.1007/978-3-540-45138-9_1 fatcat:63gfw422i5bfrimhgqxxa6d6qy

Enhancement of security in cloud computing with secure multi-party computation

A Vijaya Kumar, N J.V.Vineetha, P Sai Chakradar, K Kalyan Sai
2017 International Journal of Engineering & Technology  
The N sets of parties which are allowed by unconditionally the secure multiparty computation (MPC) for computing securely with a registered function f with the help of unbounded adversary computational  ...  The Protocols of MPC which are known and efficient are developed for online or offline framework.  ...  A fair coin tossed by semi honest party, that transmit message based on particular program, the semi honest party consider as honest verifier which have 0 knowledge.  ... 
doi:10.14419/ijet.v7i1.1.9848 fatcat:2c65v5o3yzc35gfirotmrr4hhy
« Previous Showing results 1 — 15 out of 183 results