SiBIR: Signer-base intrusion-resilient signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2442, Issue , 2002, Pages 499-514

  Itkis, Gene ^a   Reyzin, Leonid ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CERTIFICATE REVOCATION; FORWARD-SECURE; INTRUSION-RESILIENT; PROVABLY SECURE; RANDOM ORACLE MODEL; SIGNATURE SCHEME; STRONG RSA ASSUMPTION; TIME-PERIODS;

AUTHENTICATION;

EID: 84937422774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_32     Document Type: Conference Paper

References (26)

1. AMN01. Michel Abdalla, Sara Miner, and Chanathip Namprempre. Forward-secure threshold signature schemes. In David Naccache, editor, Progress in Cryptology – CT-RSA 2001, Lecture Notes in Computer Science2020, 2001
2. And97. Ross Anderson. Invited lecture. Fourth Annual Conference on Computer and Communications Security, ACM, 1997
3. BM99. Mihir Bellare and Sara Miner. A forward-secure digital signature scheme In Michael Wiener, editor, Advances in Cryptology – CRYPTO ’99, volume 1666 of Lecture Notes in Computer Science, pages 431–448 Springer-Verlag, 15–19 August 1999. Revised version is available from http://www.cs.ucsd.edu/˜mihir/
4. BP97. Niko Bari´c and Birgit Pfitzmann. Collision-free accumulators and failstop signature schemes without trees. In Walter Fumy, editor, Advances in Cryptology – EUROCRYPT 97, volume 1233 of Lecture Notes in Computer Science, pages 480–494. Springer-Verlag, 11–15 May 1997
5. CS00. Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161–185, 2000
6. DF89. Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In G. Brassard, editor, Advances in Cryptology – CRYPTO ’89, volume 435 of Lecture Notes in Computer Science, pages 307–315. Springer-Verlag, 1990
7. DKXY. Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, and Moti Yung. Strong key-insulated signature schemes. Unpublished Manuscript
8. DKXY02. Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, and Moti Yung. Keyinsulated public key cryptosystems. In Lars Knudsen, editor, Advances in Cryptology – EUROCRYPT 2002, Lecture Notes in Computer Science Springer-Verlag, 28 April–2 May 2002
9. FO97. Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Burton S. Kaliski Jr., editor, Advances in Cryptology – CRYPTO ’97, volume 1294 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 17–21 August 1997
10. GGM00. Irene Gassko, Peter Gemmell, and Philip MacKenzie. Efficient and fresh certication, 2000
11. GMR88. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281–308, April 1988
12. GMW87. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 218–229, New York City, 25–27 May 1987.
13. GPR98. Oded Goldreich, Birgit Pfitzmann, and Ronald L. Rivest. Self-delegation with controlled propagation – or – what if you lose your laptop. In Hugo Krawczyk, editor, Advances in Cryptology – CRYPTO ’98, volume 1462 of Lecture Notes in Computer Science, pages 153–168. Springer-Verlag, 23–27 August 1998
14. GQ88. Louis Claude Guillou and Jean-Jacques Quisquater. A “paradoxical” indentity-based signature scheme resulting from zero-knowledge. In Shafi Goldwasser, editor, Advances in Cryptology – CRYPTO ’88, volume 403 of Lecture Notes in Computer Science, pages 216–231. Springer-Verlag, 1990
15. HJJ+97. Amir Herzberg, Markus Jakobsson, Stanis_law Jarecki, Hugo Krawczyk, and Moti Yung. Proactive public key and signature systems. In Fourth ACM Conference on Computer and Communication Security, pages 100– 110. ACM, April 1–4 1997
16. IR01. Gene Itkis and Leonid Reyzin. Forward-secure signatures with optimal signing and verifying. In Joe Kilian, editor, Advances in Cryptology – CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 332–354. Springer-Verlag, 19–23 August 2001
17. Kat02. Jonathan Katz. A forward-secure public-key encryption scheme. Cryptology ePrint Archive, Report 2002/60, 2002. http://eprint.iacr.org/
18. LR00. Anna Lysyanskaya and Ron Rivest. Bepper-based signatures. Presented by Rivest at the CIS seminar at MIT, 27 October 2000
19. Mic96. Silvio Micali. Efficient certificate revocation. Technical Report MIT/LCS/TM-542b, Massachusetts Institute of Technology, Cambridge, MA, March 1996
20. MR01a. Philip D. MacKenzie and Michael K. Reiter. Delegation of cryptographic servers for capture-resilient devices. In Eighth ACM Conference on Computer and Communication Security, pages 10–19. ACM, November 5–8 2001
21. MR01b. Philip D. MacKenzie and Michael K. Reiter. Networked cryptographic devices resilient to capture. In IEEE Symposium on Security and Privacy, pages 12–25, 2001
22. OY91. Rafail Ostrovsky and Moti Yung. How to withstand mobile virus attacks In 10-th Annual ACM Symp. on Principles of Distributed Computing, 1991
23. PS96. David Pointcheval and Jacques Stern. Security proofs for signature schemes. In Ueli Maurer, editor, Advances in Cryptology – EUROCRYPT 96, volume 1070 of Lecture Notes in Computer Science, pages 387–398. Springer-Verlag, 12–16 May 1996
24. Riv98. Ronald L. Rivest. Can we eliminate certificate revocation lists? In Rafael Hirschfeld, editor, Financial Cryptography, volume 1465 of Lecture Notes in Computer Science. Springer-Verlag, 1998
25. Sha83. Adi Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Transactions on Computer Systems, 1(1):38–44, 1983
26. Yao82. A.C. Yao. Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science, pages 160–164, Chicago, Illinois, 3–5 November 1982. IEEE