Filters








925 Hits in 2.6 sec

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

Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan
2009 Information and Computation  
This approach leads to relatively poor round complexity when such protocols are compiled to run over a point-to-point network.  ...  We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)?  ...  Acknowledgments We thank Tal Rabin and the anonymous referees for their helpful suggestions.  ... 
doi:10.1016/j.ic.2009.03.007 fatcat:35jniy24tffofjt5rrhvovwiuu

Improving the Round Complexity of VSS in Point-to-Point Networks [chapter]

Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan
Lecture Notes in Computer Science  
This approach leads to relatively poor round complexity when protocols are compiled for a point-to-point network.  ...  We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)?  ...  It would, of course, be nice to characterize the optimal round complexity of VSS in point-to-point networks.  ... 
doi:10.1007/978-3-540-70583-3_41 fatcat:eyleueizzfbcbid2fraadkd5ky

Round-Efficient Secure Computation in Point-to-Point Networks [chapter]

Jonathan Katz, Chiu-Yuen Koo
2007 Lecture Notes in Computer Science  
In all cases, we achieve optimal security threshold for adaptive adversaries, and obtain protocols whose round complexity (in a point-to-point network) improves on prior work.  ...  We argue that if the goal is to optimize round complexity in point-topoint networks, then it is preferable to design protocols -assuming a broadcast channel -minimizing the number of rounds in which broadcast  ...  Can we obtain a similar characterization of the round complexity of VSS in a point-to-point network?  ... 
doi:10.1007/978-3-540-72540-4_18 fatcat:lt54glncwndbrkud3vez3zdbru

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

Juan Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov
2014 Lecture Notes in Computer Science  
Because broadcast cannot be simulated on a point-to-point network when a third or more of the parties are corrupt, it is impossible to construct VSS (and more generally, MPC) protocols in this setting  ...  In this work we consider a refinement of the round complexity of VSS, by adding a measure we term broadcast complexity.  ...  [KKK08, KK07, Koo07] , seeking to improve overall round complexity when broadcast is simulated over point-to-point channels, construct constant-round protocols for VSS and MPC whose descriptions use only  ... 
doi:10.1007/978-3-319-04268-8_12 fatcat:misuq2f64fat5eohmwjybejo3i

Computational Verifiable Secret Sharing Revisited [chapter]

Michael Backes, Aniket Kate, Arpita Patra
2011 Lecture Notes in Computer Science  
Interestingly, for the optimal resiliency conditions, the least possible round complexity in the known computational VSS schemes is identical to that in the (statistical or perfect) unconditional setting  ...  Further, in the synchronous communication model, we observe that a crucial interactive complexity measure of round complexity has never been formally studied for computational VSS.  ...  We are also grateful to Ian Goldberg and Mehrdad Nojoumian for interesting initial discussions.  ... 
doi:10.1007/978-3-642-25385-0_32 fatcat:oiqswlvckjaungjgjgov4sxx6y

On expected constant-round protocols for Byzantine agreement

Jonathan Katz, Chiu-Yuen Koo
2009 Journal of computer and system sciences (Print)  
Combined with existing results, this gives the first expected constantround protocol for secure computation with honest majority in a point-to-point network under the same assumptions.  ...  Our key technical tool -a new primitive we introduce called moderated VSS -also yields a simpler proof of the Feldman-Micali result.  ...  Acknowledgments We thank the anonymous reviewers for several helpful comments.  ... 
doi:10.1016/j.jcss.2008.08.001 fatcat:3b3taekqkjgs3elnj2xf5fbhiu

On Expected Constant-Round Protocols for Byzantine Agreement [chapter]

Jonathan Katz, Chiu-Yuen Koo
2006 Lecture Notes in Computer Science  
Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network assuming only one-way functions and a PKI.  ...  Our key technical tool -a new primitive we introduce called moderated VSS -also yields a simpler proof of the Feldman-Micali result.  ...  In the proof below, we assume a gradecast channel for simplicity of exposition; in Appendix B, we show how to improve the round complexity of our protocol by working directly in the point-to-point model  ... 
doi:10.1007/11818175_27 fatcat:vfi2lflcsfaw7fo34voqljgkvi

Fast and unconditionally secure anonymous channel

Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov
2014 Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14  
In addition, since broadcast cannot be simulated in a pointto-point network when a third or more of the participants are corrupt, it is impossible to construct VSS (and, more generally, any other basic  ...  on a special-purpose secure multiparty computation protocol implementing the method of "throwing darts;" its round complexity is essentially equal to that of the VSS protocol.  ...  In constrast, the round complexity of the protocol presented here is essentially equal to that of the used VSS protocol (e.g., 7 rounds in the case of [RB89] ).  ... 
doi:10.1145/2611462.2611494 dblp:conf/podc/GarayGOR13 fatcat:zozxcmrufvacta334227uiuk5a

Ant Colony Optimization Based Handoff Scheme and Verifiable Secret Sharing Security with M-M Scheme for VoIP

Shankar Ramasamy, Karthikeyan Eswaramoorthy
2017 International Journal of Intelligent Engineering and Systems  
In this research, the scheme of Multiplex-Multicast (M-M) is proposed that will improve the capability of VoIP in WLAN to 100% in the form of an infrastructure Basic Service Set (BSS).  ...  This research work deals with the security features of VoIP in order to enhance the quality making use of Verifiable Secret Sharing (VSS) with the help of M-M scheme.  ...  Unluckily, firewalls introduced to a VoIP network make different aspects of VoIP to be complex. Sisalem et al [9] studied about the challenges with consideration to the DoS attacks of VoIP servers.  ... 
doi:10.22266/ijies2017.1031.29 fatcat:tf632s5h4jhrzh2aqeyalhgix4

Towards Scalable Threshold Cryptosystems

Alin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham, Benny Pinkas, Guy Golan Gueta, Srinivas Devadas
2020 2020 IEEE Symposium on Security and Privacy (SP)  
Second, the complaint round complexity increases from O(t) to O(t log t) time and communication (but we improve it in §III-C2).  ...  Our work improves eVSS to Θ(n log t) dealing time at the cost of Θ(log t) verification round time.  ...  The key observation is that, when computing the AMT, divisions at higher levels (i.e., closer to the root) in the tree are trivial and need not be performed.  ... 
doi:10.1109/sp40000.2020.00059 dblp:conf/sp/TomescuCZAPGD20 fatcat:un3ibccy7vfh3hzl647icydzpu

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.  ...  Deploying a multi-valued broadcast protocol to emulate the broadcasts required in the existing VSS protocols will further add an O(n) factor in the communication complexity over the point-to-point channels  ... 
doi:10.1007/978-3-319-72089-0_6 fatcat:pzovrxfrz5h5bfmjpxbmliukve

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase [chapter]

Ronald Cramer, Ivan Damgård, Serge Fehr
2001 Lecture Notes in Computer Science  
We show an application of this to multi-party computation with pre-processing, improving the complexity of earlier similar protocols by a factor of n.  ...  Closing this gap, we present a new VSS protocol where the distribution complexity matches that of the previously best known VSS, but where the reconstruction phase meets our lower bound up to a constant  ...  We will call such a scheme Single-Round Honest-Dealer VSS. Our main point of interest is the communication complexity of the reconstruction phase of such a scheme.  ... 
doi:10.1007/3-540-44647-8_30 fatcat:57tfyee4ofgtpmc5i3q5m6ugam

Delegated Proof of Secret Sharing: A Privacy-Preserving Consensus Protocol Based on Secure Multiparty Computation for IoT Environment

Tieming Geng, Laurent Njilla, Chin-Tser Huang
2022 Network  
Specifically, DPoSS first uses polynomial interpolation to select a dealer group from many nodes to maintain the consensus of the blockchain system, in which the dealers in the dealer group take turns  ...  A key aspect of privacy in the blockchain is the sensitive content of transactions in the permissionless blockchain.  ...  As shown in Figure 2 , the red dots represent the data points in 1000 rounds of polynomial interpolation.  ... 
doi:10.3390/network2010005 fatcat:x7v6sncmzrfmle7foomxmzqeq4

Energy-efficient data acquisition in wireless sensor networks through spatial correlation

Li Xun, Tang Shiqi, Geoff V Merrett, Neil M White
2011 2011 IEEE International Conference on Mechatronics and Automation  
In this paper, we report on the design of a distributed sampling scheme referred to as the 'Virtual Sampling Scheme(VSS)'.  ...  VSS primarily utilizes redundancy of sensor nodes to get only a subset to sense the environment at any one time.  ...  A few points in Figure 8b show a greater variance, but in most cases, although only a subset of the nodes take part in the sampling process at any one time, the fusion result is improved.  ... 
doi:10.1109/icma.2011.5985808 fatcat:374pkpcveffdzelnog5u57sjuy

Secure Multi-party Shuffling [chapter]

Mahnush Movahedi, Jared Saia, Mahdi Zamani
2015 Lecture Notes in Computer Science  
In particular, we require each party to send only a polylogarithmic number of bits and perform a polylogarithmic number of operations while incurring only a logarithmic round complexity.  ...  This is the extended version of the paper published in the proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), Montserrat, Spain, 2015.  ...  Acknowledgment The authors would like to acknowledge supports from NSF under grants CCF-1320994, CCR-0313160, and CAREER Award 644058.  ... 
doi:10.1007/978-3-319-25258-2_32 fatcat:ger7t4s6h5avjnnbeefg7sfv3i
« Previous Showing results 1 — 15 out of 925 results