327.D. Chaum, "Undeniable Signature Systems," U.S. Patent #4,947,430, 7 Aug 1990.

328.D. Chaum, "Returned-Value Blind Signature Systems," U.S. Patent #4,949,380, 14 Aug

329.D. Chaum, "Zero-Knowledge Undeniable Signatures, " Advances in Cryptology EUROCRYPT 90 Proceedings, Springer-Verlag, 1991, pp. 458-464.

330.D. Chaum, "Group Signatures," Advances in Cryptology EUROCRYPT 91 Proceedings, Springer-Verlag, 1991, pp. 2.57-265.

331.D. Chaum, "Unpredictable Blind Signature Systems," U.S. Patent #4,991,210, 5 Feb 1991.

332.D. Chaum, "Achieving Electronic Privacy," Scientific American, v. 267, n. 2, Aug 1992, pp.

96-101.

333.D. Chaum, "Designated Confirmer Signatures," Advances in Cryptology E UROCRYPT 94

Proceedings, Springer-Verlag, 1995, to appear.

334.D. Chaum, C. Crepeau, and I.B. Damgard, "Multiparty Unconditionally Secure Protocols, "

Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 11-19.

335.D. Chaum, B. den Boer, E. van Heyst, S. Mjolsnes, and A. Steenbeek, "Efficient Offline

Electronic Checks," Advances in Cryptology E UK OCRYPT 89 Proceedings, Springer-Verlag, 1990, pp. 2Y4-301.

336.D. Chaum and J.-H. Evertse, "Cryptanalysis of DES with a Reduced Number of Rounds;

Scqucnces of Linear Factors in Block Ciphers, " Advances in Cryptology CRYPTO 85 Proceedings, Springer-Verlag, 1986, pp. 192-211.

337.D. Chaum, J.-H. Evertse, and J. van de Graff, "An Improved Protocol for Demonstrating

Possession of Discrete Logarith ms and Some Generalizations, " Advances in Cryptology EUROCRYPT 87 Proceedings, Springer-Verlag, 1988, pp. 127 141.

338.D. Chaum, J.-H. Evertse, J. van de Graff, and R. Peralta, "Demonstrating Possession of a

Discrete Logarithm without Revealing It, " Advances in Cryptology CRYPTO 86 Proceedings, Springer-Verlag, 1987, pp. 200-212.

339.D. Chaum, A. Fiat, and M. Naor, "Untraceable Electronic Cash," Advances in Cryptology

CRYPTO 88 Proceedings, Springer-Verlag, 1990, pp. 319-327.

340.D. Chaum and T. Pedersen, "Transferred Cash Grows in Size," Advances in Cryptology

EUROCRYPT 92 Proceedings, Springer-Verlag, 1993, pp. 391-407.

341.D. Chaum and T. Pedersen, "Wallet Databases with Observers," Advances in Cryptology

CRYPTO 92 Proceedings, Springer-Verlag, 1993, pp. 89-105.

342.D. Chaum and J. Schaumuller-Bichel, eds., Smart Card 2000, North Holland: Elsevier

Science Publishers, 1989.

343.1). Chaum and H. van Antwcrpen, "Und eniable Signaturcs," Advances in Cryptology CRYPTO 89 Proceedings, Springcr-Verlag, 1990, pp. 212-216.

344.D. Chaum, E. van Heijst, and B. Pfitzmann, "Cryptographically Strong Undeniab le

Signatures, Unconditionally Secure for thc Signer, " Advances in Cryptology CRYPTO 91 Proceedings. Springer-Verlag, 1992, pp. 470-484.

345.T.M. Chee, "The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular

Knapsacks, " Advances in Cryptology CKYP TO 91 Proceedings, Springer-Verlag, 1992,

pp. 204-212.

346.L Chen, "Oblivious Signatures," Computer Security ESORICS 94, Springcr-Verlag, 19 94,

pp. 161-172,

347.L. Chen and M. Burminster, "A Practical Secret Voting Scheme which Allows Voters to

Abstain," CHINACRYPT 94, Xidian, China, 11-15 Nov 1994, pp. 100-107.

348.L. Chen and T.P Pedersen "New Group Signature Schemes, " Advances in Cryptology

EUROCRYPT 94 Proceedings, Springer-Verlag, 1995, to appear.

349.J. Chenhui, "Spectral Characteristics of Partially-Bent Functions," CHINACRYPT 94,

Xidian, China, 11-15 Nov 1994, pp. 48-51.

350.V. Chepyzhov and B. Smeets, "On a Fast Correlation Attack on Certain Stream Ciphers,"

Advances in Cryptology EUR OCRYPT 91 Proceedings, Springer-Verlag, 1991, pp. 176185.

351.T.C. Cheung, "Management of PEM Public Key Certificates Using X.500 Directory

Service: Some Problems and Solutions," Proceedings of the lnternet Society 1994 Workshop on Network and Distnhuted System Security. The Internet Society, 1994, pp.

352.G.C. Chiou and W.C. Chen, "Secure Broadcasting Using the Secure Lock, " IEEE Transactions on Software Engineenng, v. SE-15, n. 8, Aug 1989, pp. 929-934.

353.Y.J. Choie and H.S. Hwoang, "On the Cryptosystem Using Elliptic Curves, " Pro-

ceedings of the 1993 Korea- Japan Workshop on Information Security and Cryp tography, Seoul, Korca, 24-26 Oct 1993, pp. 105-113.

354.B. Chor and O. Goldreich, "RSA/Rabin Least Significant Bits are 1/2+1/ ... Secure, "

Advances in Cryptology: Proceedings of CRYPTO 84, Springer-Verlag, 1985, pp. 303313.

355.B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, "Verifiable Secret Sharing and

Achieving Simultaneity in the Presence of Faults," Proceedings of the 26th Amlual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 383-395.

356.B. Chor and R.L. Rivcst, "A Knapsack Typc Public Key Cryptosystem Based on Arith-

mctic in Finitc Fields," Advallces ill Cryptology: Proceedings of CRYPTO 84, Springer-

Verlag, 1985, pp. 54-65.

357.R Christoffersson, S.-A. Ekahll, V. Fak, S. Herda, R Mattila, W. Price, and H.-O. Wid-

man, Crypto Users Handbook: A Guide for Implementors of Cryptograp hic Protection in Computer Systems, North Holland Elscvicr Scicncc Publishcrs, 1988.

358.R. Cleve, "Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, " Advances in Cryptology CRYPTO 89 Proceedings, Springer-Verlag, 1990, pp. 572-588.

359.J.D. Cohen, "Improving Privacy in Cryptographic Elections," Yale University Computer Science Department Technical Report YALEU/DCS/TR-454, Feb 1986.

360.J.D. Cohen and M.H. Fischer, "A Robust and Verifiable Cryptographically Secure Election Scheme, " Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985. pp. 372-382.

361.R. Cole, "A Model for Security in Dis tributed Systems," Computers and Secu rity, v.9 , n.4, Apr 1990, pp.319-330.

362.Comptroller General of the United States, "Matter of National Institute of Standards and Technology Use of Electronic Data Interchange Technology to Create Valid Obligations," File B-245714, 13 Dec 1991.

363.M.S. Conn, letter to Joe Abernathy, National Security Agency, Ser: Q43-111 92, 10 Jun

364.C. Connell, "An Analysis of NewDES: A Modified Version of DES," Cryptologia, v. 14, n. 3, Jul 1990, pp. 217-223.

365.S.A. Cook, "The Complexity of Theorem Proving Procedures," Proceedings of the 3rd Annual ACM Symposium on the The oryofComputing, 1971,pp. 151-158.

366.R.H. Cooper and W. Patterson, "A Generalization of the Knapsack Method Using Galois Fields," Cryptologia, v. 8, n. 4, Oct 1984, pp. 343-347.

367.R.H. Cooper and W. Patterson, "RSA as a Benchmark for Multiprocessor Machines, " Advances in Cryptology AUSCRYPT90 Proceedings, Springer-Verlag, 1990, pp. 356359.