Threshold RSA for dynamic and ad-hoc groups

作者: Rosario Gennaro , Shai Halevi , Hugo Krawczyk , Tal Rabin

DOI: 10.1007/978-3-540-78967-3_6

关键词: Signature (logic)Distributed computingMathematicsFlexibility (engineering)Protocol (object-oriented programming)Hash functionComputer networkSoftware deploymentRandom oracleGroup (mathematics)

摘要: We consider the use of threshold signatures in ad-hoc and dynamic groups such as MANETs ("mobile networks"). While known RSA signature schemes have several properties that make them good candidates for deployment these scenarios, none seems practical enough realistic highly-constrained environments. In particular, this is case most efficient schemes, namely, one due to Shoup. Our contribution presenting variants Shoup's protocol overcome limitations original unsuitable groups. The resultant provide efficiency flexibility needed groups, add capability incorporating new members (share-holders) group potential signers without relying on central authorities. Namely, any existing can cooperate a member. are efficient, fully non-interactive do not assume broadcast.

参考文章(25)
Hideki Imai, Manuel Cerecedo, Tsutomu Matsumoto, Efficient and secure multiparty generation of digital signatures based on discrete logarithms IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. pp. 532- 545 ,(1993)
Rosario Gennaro, Hugo Krawczyk, Tal Rabin, RSA-Based Undeniable Signatures international cryptology conference. pp. 132- 149 ,(1997) , 10.1007/BFB0052232
Yvo Desmedt, Yair Frankel, Shared Generation of Authenticators and Signatures (Extended Abstract) international cryptology conference. pp. 457- 469 ,(1991)
Yvo Desmedt, Society and Group Oriented Cryptography: A New Concept international cryptology conference. pp. 120- 127 ,(1987) , 10.1007/3-540-48184-2_8
Yvo Desmedt, Yair Frankel, Shared generation of authenticators and signatures international cryptology conference. pp. 457- 469 ,(1991) , 10.1007/3-540-46766-1_37
Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin, Robust and Efficient Sharing of RSA Functions international cryptology conference. pp. 157- 172 ,(1996) , 10.1007/3-540-68697-5_13
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation symposium on the theory of computing. pp. 1- 10 ,(1988) , 10.1145/62212.62213
Alfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung, How to share a function securely Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. pp. 522- 533 ,(1994) , 10.1145/195058.195405
Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin, Robust Threshold DSS Signatures Information & Computation. ,vol. 164, pp. 54- 84 ,(2001) , 10.1006/INCO.2000.2881