Filters








18,064 Hits in 3.3 sec

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.  ...  CONCLUSIONS In this work we presented a novel proactive secret sharing scheme EPSS which improves the state of the art with respect to practicability and efficiency.  ... 
doi:10.1109/pst.2016.7907013 dblp:conf/pst/BrendelD16 fatcat:cxdperscaveltkb5f6t7jaxlym

An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol

Stanislaw Jarecki, Nitesh Saxena, Jeong Hyun Yi
2004 Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks - SASN '04  
We show how the corrupted members can influence the execution of the scheme in such a way so that the slowly leaked information is used to reconstruct the entire shared secret.  ...  Our attack stems from the fact that the threshold signature protocol which is a part of this proactive RSA scheme leaks some seemingly innocuous information about the secret signature key.  ...  While it is not clear how dangerous this released information is for a single secret sharing, in a proactive signature scheme the secret sharing is refreshed with every proactive update, and therefore  ... 
doi:10.1145/1029102.1029105 dblp:conf/sasn/JareckiSY04 fatcat:sauilwslizgv7caiaf4praljsu

Further Simplifications in Proactive RSA Signatures [chapter]

Stanisław Jarecki, Nitesh Saxena
2005 Lecture Notes in Computer Science  
The new scheme is conceptually simple because all the sharing and proactive re-sharing of the RSA secret key is done modulo a prime, while the reconstruction of the RSA signature employs an observation  ...  that the secret can be recovered from such sharing using a simple equation over the integers.  ...  The new idea was that the secret d was shared additively among the players, every share was backed-up by a secondary level of polynomial secret sharing, and the proactive update consisted of shuffling  ... 
doi:10.1007/978-3-540-30576-7_28 fatcat:cthznnve4jbwriii5e7d25h3da

An Efficient Proactive RSA Scheme for Large-Scale Ad Hoc Networks [chapter]

Ruishan Zhang, Kefei Chen
2006 IFIP International Federation for Information Processing  
In this paper, we present an efficient proactive threshold RSA signature scheme for large-scale ad hoc networks. Our scheme has two advantages.  ...  Secondly, the whole scheme is efficient.  ...  Both signature generation are based on polynomial secret shares, so the efficiency is similar. Our share distribution protocol is more efficient than that of URSA.  ... 
doi:10.1007/0-387-31173-4_36 fatcat:mmc2jmriqjbyxlzaxrlbjaypbu

On the Insecurity of Proactive RSA in the URSA Mobile Ad Hoc Network Access Control Protocol

Stanisław Jarecki, Nitesh Saxena
2010 IEEE Transactions on Information Forensics and Security  
We show how the corrupted members can influence the execution of the scheme in such a way so that the slowly leaked information is used to reconstruct the entire shared secret.  ...  Our attack stems from the fact that the threshold signature protocol which is a part of this proactive RSA scheme leaks some seemingly innocuous information about the secret signature key.  ...  This is because it relies solely on Shamir's polynomial secret sharing scheme [37] , as opposed to resorting to an additional layer of additive secret sharing, as is done by the two most efficient provably  ... 
doi:10.1109/tifs.2010.2058104 fatcat:4qa52da3qbgupigimk4ymajxtm

An efficient proactive RSA scheme for large-scale ad hoc networks

Rui-shan Zhang, Ke-fei Chen
2007 Journal of Shanghai University (English Edition)  
In this paper, we present an efficient proactive threshold RSA signature scheme for large-scale ad hoc networks. Our scheme has two advantages.  ...  Secondly, the whole scheme is efficient.  ...  Both signature generation are based on polynomial secret shares, so the efficiency is similar. Our share distribution protocol is more efficient than that of URSA.  ... 
doi:10.1007/s11741-007-0111-4 fatcat:b72h3c2d4jcqriwfppfngxpsfy

Proactive Verifiable Linear Integer Secret Sharing Scheme [chapter]

Chuangui Ma, Xiaofei Ding
2009 Lecture Notes in Computer Science  
The commonly used technique for cheating detection in verifiable secret sharing (VSS) require public key systems.  ...  For further consideration of share refreshing and renewal, this paper shows the proactive property of our scheme with new method.  ...  [9] specialized this notion to robust secret sharing schemes and gave a efficient proactive secret sharing scheme.  ... 
doi:10.1007/978-3-642-11145-7_34 fatcat:xnoey3lgbvchxlipkoihdkhib4

Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures [chapter]

Douglas R. Stinson, R. Wei
2000 Lecture Notes in Computer Science  
Then we construct a new proactive secret sharing scheme based on that VSS.  ...  Furthermore, we introduce some combinatorial structure into the proactive scheme to make the scheme more efficient.  ...  [15] specialized this notion to robust secret sharing schemes and gave a detailed efficient proactive secret sharing scheme. In their scheme, a secret value is shared by n servers.  ... 
doi:10.1007/3-540-46513-8_15 fatcat:oexwtdxk3rbkvmxox6h5chhcnu

A Novel Proactive Multi-secret Sharing Scheme

Bin Feng, Cheng Guo, Mingchu Li, Zhi-Hui Wang
2015 International Journal of Network Security  
A proactive secret sharing scheme is a method of sharing a secret among a set of participants.  ...  However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process.  ...  In this paper, we present a practical and efficient proactive multi-secret sharing scheme based on Xu's periodic renewing shadows secret sharing scheme.  ... 
dblp:journals/ijnsec/FengGLW15 fatcat:sk7jueeqjzcwtiedjcoy4haree

Asynchronous verifiable secret sharing and proactive cryptosystems

Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
The second part of this paper introduces proactive cryptosystems in asynchronous networks and presents an efficient protocol for refreshing the shares of a secret key for discrete logarithm-based sharings  ...  Proactive cryptosystems are another important application of verifiable secret sharing.  ...  Finally, we propose an efficient proactive refresh protocol for discrete logarithm-based sharings.  ... 
doi:10.1145/586123.586124 fatcat:cewp7oefhzct7bn52umtc7rbli

Asynchronous verifiable secret sharing and proactive cryptosystems

Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
The second part of this paper introduces proactive cryptosystems in asynchronous networks and presents an efficient protocol for refreshing the shares of a secret key for discrete logarithm-based sharings  ...  Proactive cryptosystems are another important application of verifiable secret sharing.  ...  Finally, we propose an efficient proactive refresh protocol for discrete logarithm-based sharings.  ... 
doi:10.1145/586110.586124 dblp:conf/ccs/CachinKLS02 fatcat:qdtmfrdg2ra2fk6kzfqsppa4g4

Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups

Ruchira Naskar, Indranil Sengupta
2010 International Journal of Computer Science & Information Technology (IJCSIT)  
Our work is based on traditional (k +1; n)-threshold secret sharing, which is secure as long as an adversary can compromise not more than k secret shares.  ...  Secret sharing in user hierarchy represents a challenging area for research.  ...  This paper also presents an efficient proactive share renewal mechanism, which removes the vulnerabilities of the hierarchical secret sharing scheme, due to the presence of a mobile adversary within a  ... 
doi:10.5121/ijcsit.2010.2312 fatcat:u53s7usbengdzhrpvz245vfxxu

Communication-Optimal Proactive Secret Sharing for Dynamic Groups [chapter]

Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky
2015 Lecture Notes in Computer Science  
In dynamic proactive secret sharing (DPSS) the number of parties can vary during the course of execution.  ...  Proactive secret sharing (PSS) schemes are designed for settings where long-term confidentiality of secrets has to be guaranteed, specifically, when all participating parties may eventually be corrupted  ...  Definitions We first provide definitions of secret sharing (SS), proactive secret sharing (PSS), and dynamic proactive secret sharing (DPSS) schemes.  ... 
doi:10.1007/978-3-319-28166-7_2 fatcat:tap7ss2xsfcoloaz6jimm5podu

Asynchronous Proactive Cryptosystems Without Agreement [chapter]

Bartosz Przydatek, Reto Strobl
2004 Lecture Notes in Computer Science  
The building blocks of proactive cryptosystems -to which we present novel solutions -are protocols for joint random secret sharing and for proactive secret sharing.  ...  In this paper, we present efficient asynchronous protocols that allow to build proactive cryptosystems secure against a mobile fail-stop adversary.  ...  Section 4 presents an efficient secret sharing protocol, which will be useful in our constructions. In Section 5 we present our solution for an asynchronous proactive pseudorandomness scheme.  ... 
doi:10.1007/978-3-540-30539-2_12 fatcat:3tizfg23u5dvxiez33sjmilmfi

A simplified approach to threshold and proactive RSA [chapter]

Tal Rabin
1998 Lecture Notes in Computer Science  
The signing key, in our solution, is shared at all ~imes in additive form, which allows for simple signing and for a particularly efficient and straightforward refreshing process for proactivization.  ...  We present a solution to both the robust threshold RSA and proactive RSA problems. Our solutions are conceptually simple, and allow for an easy design of the system.  ...  We return to the construction of sharing the key at all ~imes in additive form, which allows for simple signing and for a particularly efficient and straightforward refreshing process for proactivization  ... 
doi:10.1007/bfb0055722 fatcat:br5gnkaoizbtbcicpsiq3jghs4
« Previous Showing results 1 — 15 out of 18,064 results