Abstract
Adaptive security has recently been a very active area of research. In this paper we consider how to achieve adaptive security in the additive-sharing based proactive RSA protocol (from Crypto97). This protocol is the most efficient proactive RSA protocol for a constant number of shareholders, yet it is scalable, i.e., it provides reasonable asymptotic efficiency given certain constraints on the corruption threshold. It is based on organizing the shareholders in a certain design (randomly generated, in the asymptotic case) of families of committees and establishing communications based on this organization. This structure is very different than polynomial-based proactive RSA protocols, and the techniques for achieving adaptive security for those protocols do not apply. Therefore, we develop new techniques for achieving adaptive security in the additive-sharing based proactive RSA protocol, and we present complete proofs of security.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Alexi, B. Chor, O. Goldreich and C. Schnorr. RSA and Rabin Functions:Certain Parts are as Hard as the Whole. In SIAM Journal of Computing,volume 17, n. 2, pages 194–209, April 1988
N. Alon, Z. Galil and M. Yung, Dynamic-resharing Verifiable Secret Sharing, European Symposium on Algorithms (ESA) 95, Springer-Verlag LNCS.
N. Alon and J. H. Spencer, The Probabilistic Method Wiley-Interscience,New York, NY, 1992
E. Bach, Discrete Logarithms and Factoring.Computer Science Division (EECS) Tech. Report No. UCB/CSD 84/186., University of California,Berkeley, CA. June 1984
D. Beaver, Plug and Play Encryption, Crypto 97, pp. 75–89.
D. Beaver and S. Haber, Cryptographic protocols provably secure against dynamic adversaries, EuroCrypt 92, Springer-Verlag, 1993, 307–323
G.R. Blakley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48),1979, 313–317
M. Blum, Designing programs to check their work, ICSI Technical report TR-88-009.
C. Boyd, Digital Multisignatures, IMA Conference on Cryptography and Coding, Claredon Press, 241–246, (Eds. H. Baker and F. Piper), 1986
D. Boneh and M. Franklin, Efficient Generation of Shared RSA Keys,Crypto 97, pp. 425–439
R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multiparty Computation, ACM STOC 96, 639–648
R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive Security for Threshold Cryptosystems. In CRYPTO 99, pp. 98–115
R. Canetti and A. Herzberg, Maintaining Security in the presence of transient faults, Crypto 94, Springer-Verlag, 1994, pp. 425–438
H. Cherno.,A Measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics,23:493–509, 1952
J. Cohen and M. Fischer, A robust and verifiable cryptographically secure election scheme, FOCS 85
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, How to Share a Function Securely, ACM STOC 94, pp. 522–533. (First version May 92)
Y. Desmedt and Y. Frankel, Threshold cryptosystems, Crypto 89
Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures,Crypto 91, Springer-Verlag LNCS 576, 1992, pp. 307–315
P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proc. of the 28th IEEE FOCS, pp. 427–437, 1987
Y. Frankel,A practical protocol for large group oriented networks, Eurocrypt’ 89, Springer-Verlag LNCS 773, pp. 56–61
Y. Frankel and Y. Desmedt. Distributed reliable threshold multisignatures, Tech. Report version TR-92-04-02, Dept. of EE & CS, Univ. of Wisconsin-Milwaukee, April 1992
Y. Frankel, P. Gemmell, and M. Yung, Witness-based Cryptographic Program Checking and Robust Function Sharing Proc. of STOC, 1996, pp.499–508
Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Proactive RSA.In Crypto 97, pages 440–454
Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Optimalresilience proactive public-key cryptosystems. In FOCS’97, pages 384–393
Y. Frankel, P.D. MacKenzie, and M. Yung. Adaptively-secure distributed public-key systems. ESA 99, July 1999
Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure Proactive RSA. Asiacrypt 99, pp. 180–194
Y. Frankel, P. MacKenzie, and M. Yung, Robust Efficient Distributed RSAKey Generation STOC, 1998, pp. 663–672
Y. Frankel, P. D. MacKenzie, and M. Yung. “Pseudorandom Intermixing”:A Tool for Shared Cryptography, PKC’00
M. Franklin and M. Yung, Secure and Efficient Digital Coin, ICALP 93,Springer Verlag LNCS.
Z. Galil, S. Haber, and M. Yung, Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM Journal on Computing, vol. 18, n.4, pp.711–739, 1989. (Previous version in FOCS 85)
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Eurocrypt 96, pp. 354–371
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA, Crypto 96, pp. 157–172
S. Goldwasser and S. Micali, Probabilistic Encryption,J. Comp. Sys. Sci.28, 1984, pp. 270–299
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, How to Cope with Perpetual Leakage, or: Proactive Secret Sharing, Crypto 95, pp. 339–352
A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive public key and signature systems, The 4-th ACM Symp. on Comp. and Comm. Security. April 1997
M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive RSA for constant shareholders, manuscript.
S. Jarecki and A. Lysyanskaya, Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. In Eurocrypt 2000,pp. 221–242
M. Luby, Pseudorandomness and its Cryptographic Applications, Princeton University Press, 1996
R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, ACM Symposium on Principles of Distributed Computing (PODC), 1991, pp.51–61
T.P. Pedersen, Non-interactive and information theoretic secure verifiable secret sharing, Crypto 91, pp. 129–140
T. Rabin. A Simplified Approach to Threshold and Proactive RSA. In Crypto 98, pp. 89–104
R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of the ACM, 21 (1978),pp. 120–126
A. Shamir. How to share a secret, Comm. of the ACM, 22 (1979), pp.612–613
V. Shoup. Practical Threshold Signatures. In Eurocrypt 2000, pp. 207–220.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frankel, Y., MacKenzie, P.D., Yung, M. (2001). Adaptive Security for the Additive-Sharing Based Proactive RSA. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive