The dark side of “black-box” cryptography or: Should we trust capstone?

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

Volumn 1109, Issue , 1996, Pages 89-103

  Young, Adam ^a   Yung, Moti ^b  

^a Columbia University ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Applied systems; Auto escrowing keys; Capstone; Cryptanalytic attacks; Design and manufacturing of cryptographic devices and software; DSA; ElGamal; Hardware; Kerberos; Key escrow; Private key; Pseudorandomness; Public key; Randomness; RSA; Software; Subliminal channels

Indexed keywords

COMPUTER HARDWARE; COMPUTER SOFTWARE; MANUFACTURE; RANDOM PROCESSES; REVERSE ENGINEERING;

AUTO-ESCROWING KEYS; CAPSTONE; CRYPTANALYTIC ATTACKS; CRYPTOGRAPHIC DEVICES; ELGAMAL; KERBEROS; KEY ESCROW; PRIVATE KEY; PSEUDORANDOMNESS; PUBLIC KEYS; RANDOMNESS; SUBLIMINAL CHANNEL;

CRYPTOGRAPHY;

EID: 84955586344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_8     Document Type: Conference Paper

References (20)

1. [ACGS] W. Alexi, B. Clior, 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.
2. [And71] G. E. Andrews. ''Number Theory," page 100, 1971. Dover Publications Inc.
3. [Bac88] E. Bach. How To Generate Factored Random Numbers. In SIAM Journal of Computing, volume 17, n. 2, April 1988.
4. [BFL95] M. Blaze, J. Feigenbaum and F.T. Leighton. Masterkey Cryptosystems, CRYPTO 95 Rump session, Aug. 1995.
5. [Des90] Yvo Desmedt. Abuses in Cryptography and How to Fight Them. In Advances in Cryptology-CRYPTO '88, pages 375-389, Berlin, 1990. Springer-Verlag.
6. [Diffie] W. Diffie, Personal Communication.
7. [DSS91] Proposed Federal Information Processing Standard for Digital Signature Standard (DSS). In volume 56, n. 169 of Federal Register, pages 42980-42982, 1991.
8. [E1G85] T. EIGamal. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In Advances in Cryptology - CRYPTO '84, pages 10-18, Berlin, 1985. Springer-Verlag.
9. [Has] Matthew B. Hastings, private communication.
10. [KL95] J. Killian and F T. Leighton. Fair Cryptosystems Revisited. In Advances m Cryptology-CRYPTO '95, pages 208-221, Berlin, 1995. Springer-Verlag.
11. [LMS] J. Lacy, D. Mitchell, W. Schell. CryptoLib: Cryptography in Software. AT&T Bell Laboratories, section 2.2.1.
12. [MB95] D. Mitchell, M. Blaze, truerand.c, AT&T Laboratories, 1995.
13. [NT94] B. C. Neuman, T. Ts'o. Kerberos: An Authentication Service for Computer Networks. In IEEE Communications Magazine, pages 33-38, Sept. 1994.
14. [Rabin] M. Rabin. A Public-key and Signature Scheme as Secure as Factoring, MIT Tech. Report, 1978.
15. [RSA78] R. Rivest, A. Shamir, L. Adleman. A method for obtaining Digital Signatures and Public-Key Cryptosystems. In Communications of the ACM, volume 21, n. 2, pages 120-126, 1978.
16. [Sim85] G. J. Simmons The Subliminal Channel and Digital Signatures. In Advances in Cryptology- -EUROCRYPT 'S4, pages 51-57, Berlin, 1985. Springer-Verlag.
17. [Sim94] G. J. Simmons. Subliminal Channels: Past and Present. In European Trans, on Telecommunication, 5(4), 1994, PAGES 459-473.
18. [Tho84] K. Thompson. Reflections on Trusting Trust. In Communications of the ACM, volume 27, n. 8, August 1984.
19. [WN] D. Wheeler, R. Needham. Tiny Encryption Algorithm (TEA). In Fast Software Encryption: second internation workshop, volume 1008 of Lecture Notes in computer science, Dec. 1994. Springer.
20. [Zim92] Phil Zimmerman. PGP User's Guide, 4 Dec. 1992.