7,562 Hits in 3.6 sec

Broadcast (and Round) Efficient Verifiable Secret Sharing [chapter]

Juan Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov
2014 Lecture Notes in Computer Science  
Thus motivated to better understand the broadcast requirements of verifiable secret sharing when t < n/2, in this work we present new upper bounds on its broadcast and round complexity.  ...  Verifiable secret sharing (VSS) is a fundamental cryptographic primitive, lying at the core of secure multi-party computation (MPC) and, as the distributed analogue of a commitment functionality, used  ...  Our weak secret sharing and verifiable secret sharing protocols make use of a linear IC subprotocol based on that of [CDD + 01], with some minor adjustments to increase broadcast efficiency.  ... 
doi:10.1007/978-3-319-04268-8_12 fatcat:misuq2f64fat5eohmwjybejo3i

Round-Optimal and Efficient Verifiable Secret Sharing [chapter]

Matthias Fitzi, Juan Garay, Shyamnath Gollakota, C. Pandu Rangan, Kannan Srinathan
2006 Lecture Notes in Computer Science  
The solution is based on a three-round solution of so-called weak verifiable secret sharing (WSS), for which we also prove that three rounds is a lower bound.  ...  We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players in a  ...  Weak verifiable secret sharing (WSS).  ... 
doi:10.1007/11681878_17 fatcat:cea6grrsyzeilg77rvvqmmwuke

Efficient Dynamic-Resharing "Verifiable Secret Sharing" against mobile adversary [chapter]

Noga Alon, Zvi Galil, Moti Yung
1995 Lecture Notes in Computer Science  
We present a novel efficient variant of Verifiable Secret Sharing (VSS) where the dealing of shares is dynamically refreshed (without changing or corrupting the secret) against the threat of the recently  ...  We also present constant round protocols (e.g., a single round VSS) and do not use general (polynomial time, but inefficient) tools.  ...  In such a protocol, after the first sharing, the dealer will forget its secret and the community will maintain the secret (secrecy and reconstructability is verifiably kept).  ... 
doi:10.1007/3-540-60313-1_168 fatcat:6jny5mkx45g6vjfcjxnfucab5u

Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing [chapter]

Mehrdad Nojoumian, Douglas R. Stinson
2014 Lecture Notes in Computer Science  
Our motivation is to apply verifiable secret sharing in order to construct various kinds of sealed-bid auctions.  ...  This article proposes efficient solutions for the construction of sealed-bid second-price and combinatorial auction protocols in an active adversary setting.  ...  Protocol Cryptographic Technique Adversary Model Here Verifiable Secret Sharing Active [25] Homomorphic Encryption Active [14, 15] Secret Sharing Passive [10] Verifiable Secret and Signature Sharing  ... 
doi:10.1007/978-3-319-06320-1_23 fatcat:fa325nsns5dipmjyin3mc6jfam

Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes

Haowen Chan, Adrian Perrig
2010 2010 IEEE Symposium on Security and Privacy  
present the first analysis on reducing the number of rounds of interaction in broadcast authentication protocols deployed over network  ...  regardless of the size of the broadcast data payload and the particular physical or linklayer characteristics of the network.  ...  The sender s shares a unique secret key K i with each receiver node d i .  ... 
doi:10.1109/sp.2010.22 dblp:conf/sp/ChanP10 fatcat:jxr46gvrgbhkjpn362slencyvu

Communication and Round Efficient Information Checking Protocol [article]

Arpita Patra, C. Pandu Rangan
2010 arXiv   pre-print
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing (VSS) and Weak Secret  ...  Though not presented in this paper, we can design communication and round efficient statistical (i.e involves negligible error probability in computation) VSS and Multiparty Computation (MPC) protocol  ...  ICP can be studied in multi verifier and multi secret settings in asynchronous network where we may investigate the issues like communication efficiency etc.  ... 
arXiv:1004.3504v1 fatcat:caapstidqjdg5o7lnlcvn2wi24

Secure Anonymous Broadcast [article]

Mahnush Movahedi and Jared Saia and Mahdi Zamani
2014 arXiv   pre-print
O( n) rounds of communication.  ...  In this paper, we design decentralized protocols for anonymous broadcast that require each party to send (and compute) a polylogarithmic number of bits (and operations) per anonymous bit delivered with  ...  Verifiable Secret Sharing.  ... 
arXiv:1405.5326v1 fatcat:22npksye7vaqlg72ipshrmc2eu

Adaptively Secure Broadcast [chapter]

Martin Hirt, Vassilis Zikas
2010 Lecture Notes in Computer Science  
Note that verifiable secret-sharing exists only for t < n/2 (but not for t = n/2).  ...  The only issue is how to do a secret-sharing without having a composable broadcast primitive. The second positive result, namely statistical and computational security for t ≤ n/2, it more involved.  ...  More concretely, when a secure Verifiable Secret Sharing (VSS) scheme is given, then one can easily construct a secure broadcast protocol (i.e., a protocol realizing F BC ) by invoking the VSS protocol  ... 
doi:10.1007/978-3-642-13190-5_24 fatcat:knlkubjavneglg3qmif5ph77pa

Efficient, Robust and Constant-Round Distributed RSA Key Generation [chapter]

Ivan Damgård, Gert Læssøe Mikkelsen
2010 Lecture Notes in Computer Science  
We present the first protocol for distributed RSA key generation which is constant round, secure against malicious adversaries and has a negligibly small bound on the error probability, even using only  ...  Now we just need to reduce y modulo the secret a and test against 1, −1. This can be done efficiently and in constant-round using a subprotocol from ACS.  ...  Utilizing pseudo random secret sharing enables active secure generation of a random secret shared number s, by only one broadcast message pr. player.  ... 
doi:10.1007/978-3-642-11799-2_12 fatcat:higzctev6vd2dcyjx7bpypinvy

TESLA Broadcast Authentication [chapter]

Adrian Perrig, J. D. Tygar
2003 Secure Broadcast Communication  
This article presents the TESLA (Timed Efficient Stream Loss-tolerant Authentication) broadcast authentication protocol, an efficient protocol with low communication and computation overhead, which scales  ...  One of the main challenges of securing broadcast communication is source authentication, or enabling receivers of broadcast data to verify that the received data really originates from the claimed source  ...  ., appending a message authentication code (MAC) to each packet, computed using a shared secret key) does not provide secure broadcast authentication.  ... 
doi:10.1007/978-1-4615-0229-6_3 fatcat:tsamkjaqtbfmhmirmy6bbx4umy

On the Complexity of Broadcast Setup [chapter]

Martin Hirt, Pavel Raykov
2013 Lecture Notes in Computer Science  
We optimize the number of rounds in which the temporary broadcast channels are used while minimizing the number of bits broadcast with them.  ...  Furthermore, only O(n 3 ) bits need to be broadcast with the temporary broadcast channels during that round, independently of the security parameter employed.  ...  Detectable Verifiable Secret Sharing Verifiable secret sharing (VSS) is a classical cryptographic primitive for secure sharing of a secret.  ... 
doi:10.1007/978-3-642-39206-1_47 fatcat:jfjdua4nubh6npbtogijdlcn4i

Round-efficient perfectly secure message transmission scheme against general adversary

Kaoru Kurosawa
2011 Designs, Codes and Cryptography  
We first give a 3-round PSMT which runs in polynomial time in the size of the underlying linear secret sharing scheme. We next present a 2-round PSMT which is inefficient in general.  ...  In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are n channels between a sender and a receiver, and they share no key.  ...  (However, it is efficient if |Γ + | is small.) Our first scheme is based on the verifiable secret sharing scheme of [2, 3] , and our second scheme is based on the secret sharing scheme of [7] .  ... 
doi:10.1007/s10623-011-9546-5 fatcat:amf6paohondg7l6d6wdjv5w47m

Broadcast Complexity and Adaptive Adversaries in Verifiable Secret Sharing

Seyed Amir Hosseini Beghaeiraveri, Mohammad Izadi, Mohsen Rezvani
2020 Security and Communication Networks  
Verifiable secret sharing (VSS) is one of the basic problems in the theory of distributed cryptography and has an important role in secure multiparty computation.  ...  Also, another important question is, would there exist a protocol to share a secret with a static adversary with at most 1 broadcast round?  ...  Verifiable Secret Sharing.  ... 
doi:10.1155/2020/9428457 fatcat:o23wz5ue3ngx7pjyulikyew3gi

Improving the round complexity of VSS in point-to-point networks

Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan
2009 Information and Computation  
We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)?  ...  (STOC 2001) and Fitzi et al. (TCC 2006) shows that, assuming a broadcast channel, three rounds are necessary and sufficient for efficient VSS.  ...  Acknowledgments We thank Tal Rabin and the anonymous referees for their helpful suggestions.  ... 
doi:10.1016/j.ic.2009.03.007 fatcat:35jniy24tffofjt5rrhvovwiuu

Round and Communication Efficient Unconditionally-Secure MPC with $$t<n/3$$ t < n / 3 in Partially Synchronous Network [chapter]

Ashish Choudhury, Arpita Patra, Divya Ravi
2017 Lecture Notes in Computer Science  
Our MPC protocol relies on a new four round, communication efficient statistical verifiable secret-sharing (VSS) protocol with broadcast communication complexity independent of the number of secret-shared  ...  We consider a partially synchronous setting, where the parties are assumed to be globally synchronized initially for few rounds and then the network becomes completely asynchronous.  ...  For this we follow the recent framework of [15] , which shows how to efficiently generate Shamir-shared multiplication triples in offline phase, using any (polynomial based) verifiable secret-sharing  ... 
doi:10.1007/978-3-319-72089-0_6 fatcat:pzovrxfrz5h5bfmjpxbmliukve
« Previous Showing results 1 — 15 out of 7,562 results