Cryptography as a Network Service

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2001

Volumn , Issue , 2001, Pages

  Berson, Tom ^a   Dean, Drew ^a   Franklin, Matt ^b   Smetters, Diana ^a   Spreitzer, Michael ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; NETWORK ARCHITECTURE; NETWORK SECURITY;

COMPUTATIONAL COSTS; CRYPTOGRAPHIC HARDWARE; CRYPTOGRAPHIC OPERATIONS; NETWORKS SERVICES; PERFORMANCE; PUBLIC KEYS; SECURE DISTRIBUTED SYSTEMS; SYMMETRIC CRYPTOGRAPHY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 85030103075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. C. Adams. RFC 2025: The simple public-key GSS-API mechanism (SPKM), Oct. 1996.
2. M. Blaze. High-bandwidth encryption with low-bandwidth smartcards. In Proceedings of the Fast Software Encryption Workshop, number 1039 in Lecure Notes in Computer Science, pages 33–40. Springer-Verlag, 1996.
3. M. Blaze, J. Feigenbaum, and M. Naor. A formal treatment of remotely keyed encryption. In K. Nyberg, editor, Proceedings of EUROCRYPT’98, number 1403 in Lecure Notes in Computer Science, pages 251–265. Springer-Verlag, 1998.
4. D. Boneh, R. DeMillo, and R. Lipton. On the importance of checking cryptographic protocols for faults. In Proceedings of Eurocrypt’97, volume 1233 of Lecture Notes in Computer Science, pages 37–51. Springer-Verlag, 1997.
5. C. Boyd. Digital multisignatures. In H. Beker and F. Piper, editors, Cryptography and Coding, Institute of Mathematics and Its Applications (IMA), pages 241–246. Clarendon Press, 1989.
6. V. Boyko, M. Peinado, and R. Venkatesan. Speeding up discrete log and factoring based schemes via precomputation. In K. Nyberg, editor, Advances in Cryptology – EUROCRYPT’98, number 1403 in LNCS, pages 221–235, Espoo, Finland, 1998. Springer-Verlag.
7. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Proceedings of EUROCRYPT’99, pages 402–414, 1999.
8. D. Chaum. Blind signatures for untraceable payments. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO 82, pages 199–203, New York, 1983. Plenum Press.
9. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology—EUROCRYPT 91, volume 547 of Lecture Notes in Computer Science, pages 257–265. Springer-Verlag, 8–11 Apr. 1991.
10. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. Journal of the Association for Computing Machinery, 45(6):965–981, Nov. 1998.
11. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Proc. CRYPTO 95, pages 174–187. Springer, 1994. Lecture Notes in Computer Science No. 839.
12. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307–315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
13. M. Eisler, A. Chiu, and L. Ling. RFC 2203: RPCSEC GSS protocol specification, Sept. 1997.
14. J. Feigenbaum. Encrypting problem instances: Or...can you take advantage of someone without having to trust him? In H. C. Williams, editor, Proc. CRYPTO 85, pages 477–488. Springer, 1986. Lecture Notes in Computer Science No. 218.
15. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 151–160, New York, May 23–26 1998. ACM Press.
16. B. Huberman, T. Hogg, and M. Franklin. Enhancing privacy and trust in electronic communities. In Proceedings of the ACM Conference on Electronic Commerce, 1999.
17. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. Maurer, editor, Advances in Cryptology—EUROCRYPT 96, volume 1070 of Lecture Notes in Computer Science, pages 143–154. Springer-Verlag, 12–16 May 1996.
18. P. Kakkar, C. A. Gunter, and M. Abadi. Reasoning about security for active networks. In Proceedings of the 13th IEEE Computer Security Foundations Workshop, pages 118–129, Cambridge, UK, July 2000.
19. B. A. LaMacchia and A. M. Odlyzko. Computation of discrete logarithms in prime fields. Designs, Codes, and Cryptography, 1:47–62, 1991.
20. A. K. Lenstra and E. R. Verheul. Selecting cryptographic key sizes. In Proceedings of the Public Key Cryptography Conference 2000, Jan. 2000. Available from http://www.cryptosavvy.com.
21. J. Linn. RFC 2743: Generic security service application program interface, version 2, update 1, Jan. 2000.
22. S. Lucks. Accelerated remotely keyed encryption. In L. Knudsen, editor, Proceedings of the Fast Software Encryption Workshop, number 1636 in Lecure Notes in Computer Science, pages 112–123. Springer-Verlag, 1999.
23. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. The CRC Press series on discrete mathematics and its applications. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1997.
24. F. Monrose, P. Wyckoff, and A. Rubin. Distributed execution with remote audit. In Proceedings of the Network and Distributed Systems Security Symposium. Internet Society, 1999.
25. N. Nisan, S. London, O. Regev, and N. Camiel. Globally distributed computation over the internet — the popcorn project. In Proceedings of the International Conference on Distributed Computing Systems, pages 592–601, 1998.