Filters








805 Hits in 8.3 sec

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 essentially reduce n out of t < n/2 VSS to n out-of n one (assuming ex-or homomorphic encryption), then we reduce dynamic resharing VSS to static VSS, finally we reduce proactive VSS (dynamic VSS with  ...  Proactive VSS from Dynamic-Resharing Next we will discuss how we can use the dynamic-resharing to have a proactive secret sharing (a secret maintained by the community).  ... 
doi:10.1007/3-540-60313-1_168 fatcat:6jny5mkx45g6vjfcjxnfucab5u

Efficient proactive secret sharing

Jacqueline Brendel, Denise Demirel
2016 2016 14th Annual Conference on Privacy, Security and Trust (PST)  
In addition to improving practicability the presented proactive secret sharing solution, called EPSS, performs data aggregation to provide an efficient solution with respect to the communication complexity  ...  The only known approach to achieve this, as required, for instance, for medical records, is to use proactive secret sharing. However, all currently known schemes suffer from being inefficient.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers of PST 2016 for their helpful comments.  ... 
doi:10.1109/pst.2016.7907013 dblp:conf/pst/BrendelD16 fatcat:cxdperscaveltkb5f6t7jaxlym

Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices

Yashvanth Kondi, Bernardo Magri, Claudio Orlandi, Omer Shlomovits
2021 2021 IEEE Symposium on Security and Privacy (SP)  
The emergence of threshold wallets for more secure cryptocurrency custody warrants an efficient proactivization protocol tailored to this setting.  ...  While many proactivization protocols have been devised and studied in the literature, none of them have communication patterns ideal for threshold wallets.  ...  [DKLs19] with our refresh procedure, and providing us with the benchmarks for that protocol reported in this paper.  ... 
doi:10.1109/sp40001.2021.00067 fatcat:hl6cetwt2bfpnbacawkuc6p2ri

A High-Assurance, Automatically-Synthesized, Evaluator for Machine-Checked (Proactively) Secure Multi-Party Computation [article]

Karim Eldefrawy, Vitor Pereira
2019 IACR Cryptology ePrint Archive  
We formalize in EasyCrypt, a tool-assisted framework for building high-confidence cryptographic proofs, several abstract and reusable variations of secret sharing and of (P)MPC protocols building on them  ...  Using those, we prove a series of abstract theorems for the proactive setting.  ...  sharing, proactive secret sharing for dishonest majorities [32, 35, 12] .  ... 
dblp:journals/iacr/EldefrawyP19 fatcat:ryexdes47nbhlha7kx2rwk7tcu

ADVANCED SECURITY FOR MANETS USING THRESHOLD CRYPTOGRAPHY

H. Ateeq Ahmed .
2015 International Journal of Research in Engineering and Technology  
The development of technologies such as Mobile and Adhoc networks have made the distributed environments widely accepted as they allows large scale support for resource sharing infrastructure.  ...  As mentioned earlier, one the major challenge that needs to be addressed is security of authentication. We conclude some issues and determine some challenges that can take place in future.  ...  ACKNOWLEDGEMENTS We wish to thanks the previous authors for providing a nice concept in the area of security.  ... 
doi:10.15623/ijret.2015.0414011 fatcat:6uin7y72hfbpbei4bwpovamtjq

ENHANCHING SECURITY FOR MANETs USING DISCRETE KEY GENERATIONS

ATEEQ AHMED H, SAMSON PAUL K, HARISH KUMAR REDDY B
2020 International Journal of Engineering Technology and Management Sciences  
Mobile Ad Hoc is a network connection method which is most often associated with wireless devices. The connection is established for the duration of one session and requires no base station.  ...  Instead, devices discover others within range to form a network for those computers. These networks often suffer with a problem of Malicious attacks from different types of attackers.  ...  Solution to proactive multi-secret Sharing Threshold Schemes For threshold multisecret sharing two schemes are in use CA-based and ID-based as proposed by.  ... 
doi:10.46647/ijetms.2020.v04i05.008 fatcat:4vdvqs6hfzhttl6ms3zlirs3q4

A STUDY ON THE EXISTING THRESHOLD CRYPTOGRAPHY TECHNIQUES

Prabha Elizabeth Varghese, Department Of Computer Science School of Engineering, CUSAT Kerala, India
2020 International Journal of Advanced Research in Computer Science  
Threshold cryptography in simple words is the art of splitting a secret into many bits. The secret can be recreated only by possessing more than a threshold number of bits of the secret.  ...  Thus for asymmetric key cryptography, threshold versions of encryptions can be built. In this paper we explore the various extensions and techniques of threshold cryptography.  ...  The extension of the protocol to a multiparty setting with dishonest majority is also described. In RSA key generation protocol, an RSA composite is generated using a distributed sub protocol.  ... 
doi:10.26483/ijarcs.v11i5.6659 fatcat:fpzqcdilmzd73afwyb32frymku

A Fully Distributed Proactively Secure Threshold-Multisignature Scheme

Johann Van Der Merwe, Dawoud S. Dawoud, Stephen McDonald
2007 IEEE Transactions on Parallel and Distributed Systems  
The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first  ...  Index Terms-Security and protection, distributed systems, group-oriented cryptography, threshold-multisignature, secret sharing, distributed-key management infrastructure, publicly verifiable distributed-key  ...  P i , i 2 share their secret share x i of group secret key x Q with P j 2 À n 0 ;t 0 P 0 , using Shamir's secret sharing scheme [21] : For i 2 : a.  ... 
doi:10.1109/tpds.2007.1005 fatcat:a5rjvg6lh5c3jo3kzz45zg7kau

Multisecret-sharing scheme with two-level security and its applications in Blockchain [article]

R. K. Sharma, Ritumoni Sarma, Neha Arora, Vidya Sagar
2022 arXiv   pre-print
A (t,m)-threshold secret sharing and multisecret-sharing scheme based on Shamir's SSS are introduced with two-level security using a one-way function.  ...  The proposed scheme is thoroughly examined in terms of security and efficiency. Privacy, security, integrity, and scalability are also analyzed while applying it to the blockchain network.  ...  In [2] , the authors have discussed Dynamic Proactive Secret Sharing (DPSS) scheme, where dealers and participants keep on changing and it is based on honest majority.  ... 
arXiv:2209.03670v1 fatcat:mmrf76zsjndpphhdiilm5fp52q

Proactively Accountable Anonymous Messaging in Verdict [article]

Henry Corrigan-Gibbs, David Isaac Wolinsky, Bryan Ford
2013 arXiv   pre-print
We present Verdict, the first practical anonymous group communication system built using proactively verifiable DC-nets: participants use public key cryptography to construct DC-net ciphertexts, and knowledge  ...  While verifiable DC-nets incurs higher computation overheads due to the public-key cryptography involved, our experiments suggest Verdict is practical for anonymous group messaging or microblogging applications  ...  For efficiency, in practice each pair of group members forms a cryptographic shared secret-via Diffie-Hellman key agreement, for example-then group members use a cryptographic pseudo-random number generator  ... 
arXiv:1209.4819v3 fatcat:kkx7vqwhqvailgyfynnqkvhxe4

Unconditionally secure social secret sharing scheme

M. Nojoumian, D.R. Stinson, M. Grainger
2010 IET Information Security  
., the number of shares a player has) as well as reputation (i.e., cooperation with other players for the share renewal or secret recovery).  ...  In other words, this scheme proactively renews shares at each cycle without changing the secret, and allows trusted participants to gain more authority.  ...  ., cooperation with other players for the share renewal or secret recovery.  ... 
doi:10.1049/iet-ifs.2009.0098 fatcat:msri3f2ra5authfu67po7dsfyu

Crypto-integrity [chapter]

Moti Yung
2002 Lecture Notes in Computer Science  
This assurance, which we call crypto-integrity will guarantee the correct functioning of the cryptographic components in an efficient fashion.  ...  We review the need for crypto-integrity in various known settings, ways to implement it based on known protocol techniques as well as potential future directions.  ...  For example a "distributed proof" can be conducted assuring a group of users with honest majority of a fact while not revealing the underlying secret.  ... 
doi:10.1007/3-540-36178-2_35 fatcat:w4ydprherzawlc3zynft2sr7ve

State Machine Replication under Changing Network Conditions [article]

Andreea B. Alexandru, Erica Blum, Jonathan Katz, Julian Loss
2022 IACR Cryptology ePrint Archive  
Protocols for state machine replication (SMR) are typically differently designed for synchronous or asynchronous networks, with a lower corruption threshold in the latter case.  ...  with optimal corruption thresholds and quadratic amortized communication complexity per transaction; 2. a statically secure protocol with near-optimal corruption thresholds and linear amortized communication  ...  Very recently, several works [27, 33] have proposed more efficient dynamic/mobile proactive secret sharing protocols assuming eventual synchrony or short periods of synchrony at the end of an epoch.  ... 
dblp:journals/iacr/AlexandruBKL22 fatcat:b6bdbg5c7nd5jh4gifxic5q2ma

A Survey of Applications of Identity-Based Cryptography in Mobile Ad-Hoc Networks

Shushan Zhao, Akshai Aggarwal, Richard Frost, Xiaole Bai
2012 IEEE Communications Surveys and Tutorials  
Furthermore, KPS is not suitable for dynamic group, because its session key is determined in advance.  ...  The authors also discuss and determine the optimal secret-sharing parameters (t, n) to achieve the maximum security and designed a novel protocol to dynamically adjust (t, n) to accommodate dynamic node  ...  The paper discusses and determines the optimal secret-sharing parameters to achieve the maximum security and designed a novel protocol to dynamically adjust them to accommodate dynamic node join/leave.  ... 
doi:10.1109/surv.2011.020211.00045 fatcat:bcgqnhfzxrdvlfoq6tmucsjdea

Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning [article]

Ewa Syta, Iulia Tamas, Dylan Visher, David Isaac Wolinsky, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, Ismail Khoffi, Bryan Ford
2016 arXiv   pre-print
The secret keys of critical network authorities - such as time, name, certificate, and software update services - represent high-value targets for hackers, criminals, and spy agencies wishing to use these  ...  CoSi builds on existing cryptographic multisignature methods, scaling them to support thousands of witnesses via signature aggregation over efficient communication trees.  ...  Acknowledgments We wish to thank Rene Peralta, Apostol Vassilev, Dan Boneh, Linus Nordberg, Ben Laurie, and Eran Messeri for valuable feedback and discussion during this project.  ... 
arXiv:1503.08768v4 fatcat:73rr7rpfund3dinso5tliqhgu4
« Previous Showing results 1 — 15 out of 805 results