Crypto Bibliography

Citations by First Author - C

C. Cachin, On the foundations of oblivious transfer [.ps], Advances in Cryptology: EUROCRYPT '98, Lecture Notes in Computer Science v. 1403, Kaisa Nyberg, ed., pp. 361-374. Springer-Verlag, 1998. [.ps] [.ps.gz]

C. Cachin, An information-theoretic model for steganography [.ps], Proc. 2nd Workshop on Information Hiding, Lecture Notes in Computer Science, David Aucsmith, ed. Springer-Verlag, 1998. [.ps] [.ps.gz]

C. Cachin, On-line secret sharing [.ps], Cryptography and Coding: 5th IMA Conference, C. Boyd, ed., Cirencester, UK, Lecture Notes in Computer Science v.1025, Springer Verlag, 1995, pp. 190-198. [.ps] [.ps.gz]

C. Cachin and U. Maurer, Smoothing probability distributions and smooth entropy; Preprint (Abstract in Proc. 1997 IEEE International Symposium on Information Theory, Ulm), 1997. [.ps] [.ps.gz]

C. Cachin, Entropy Measures and Unconditional Security in Cryptography; volume 1 of ETH Series in Information Security and Cryptography. Hartung-Gorre Verlag, Konstanz, Germany, 1997. ISBN 3-89649-185-7 (Reprint of Ph.D. dissertation No. 12187, ETH Zürich).

C. Cachin, Hashing a source with an unknown probability distribution [.ps]; manuscript (Abstract in Proc. 1998 IEEE International Symposium on Information Theory, Boston), 1998. [.ps] [.ps.gz]

C. Cachin and U. Maurer, Linking information reconciliation and privacy amplification [.ps], Journal of Cryptology, 10(2):97-110, 1997. [.ps] [.ps.gz]

C. Cachin, S. Micali, and M. Stadler, Computationally private information retrieval with polylogarithmic communication, Advances in Cryptology: EUROCRYPT '99, LNCS vol. 1592, Springer-Verlag, 1999, pp. 402-414. [.pdf] [.ps] [.ps.gz]

C. Cachin and U. Maurer, Sicherheit im Internet: Illusion oder Realität?; INFORMATIK / INFORMATIQUE, 2(2):18-23, 1995. [.ps] [.ps.gz]

C. Cachin, Smooth entropy and Rényi entropy [.ps], Advances in Cryptology: EUROCRYPT '97, ed. Walter Fumy, volume 1233 of Lecture Notes in Computer Science, Springer-Verlag, 1997, pp. 193-208. [.ps] [.ps.gz]

C. Cachin and U. Maurer, Unconditional security against memory-bounded adversaries [.ps], Advances in Cryptology: CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pp. 292-306. Springer-Verlag, 1997. [.ps] [.ps.gz]

C. Cachin, C. Crépeau, and J. Marcil., Oblivious transfer with a memory-bounded receiver [.ps], Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998. [.ps] [.ps.gz]

J. Camenisch, J.-M. Piveteau, and M. Stadler, An Efficient Electronic Payment System Protecting Privacy, Computer Security -- ESORICS 94, Lecture Notes in Computer Science v. 875, pp. 207-215, Springer Verlag, 1994. [.txt - abstract] [.pdf] [.ps]

J. Camenisch and I. Damgård, Verifiable Encryption and Applications to Group Signatures and Signature Sharing [.pdf], BRICS Technical Report, RS-98-32, 1998. [.pdf] [.ps.gz]

J. Camenisch and M. Stadler, Efficient Group Signature Schemes for Large Groups, Advances in Cryptology -- CRYPTO '97, Lecture Notes in Computer Science v. 1294, Springer Verlag, 1997, pp. 410-424. [.ps] [.ps.Z] [.ps.gz]

J. Camenisch and M. Stadler, Proof Systems for General Statements about Discrete Logarithms, Techreport TR 260, 13 pp. Institute for Theoretical Computer Science, ETH Zürich, March 1997. [.txt - abstract] [.ps] [.ps.gz]

J. Camenisch and M. Michels, A Group Signature Scheme Based on an RSA-Variant [.pdf], BRICS Technical Report, RS-98-27. A preliminary version of this paper appeared in Advances in Cryptology - ASIACRYPT '98. [.pdf] [.ps.gz]

J. Camenisch, U. Maurer, and M. Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees, Journal of Computer Security, vol. 5, no. 1, pp. 69-89, 1997, (Preliminary version in Proc. ESORICS'96). [.txt - abstract] [.pdf] [.ps]

J. Camenisch, U. Maurer, and M. Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees, Journal of Computer Security, v. 5, n. 1, IOS Press, 1997. [.ps] [.ps.Z] [.ps.gz]

J. Camenisch, J.-M. Piveteau, and M. Stadler, Blind Signatures Based on the Discrete Logarithm Problem, Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science v. 950, Springer Verlag, 1995, pp. 428-432. [.txt - abstract] [.pdf] [.ps]

J. Camenisch, Efficient and generalized group signatures; In Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 465-479, Springer Verlag, 1997. [.txt - abstract] [.pdf] [.ps]

J. Camenisch, Efficient and Generalized Group Signatures, Advances in Cryptology -- EUROCRYPT '97, v. 1233 of Lecture Notes in Computer Science, Springer Verlag, 1997, pp. 465-479. [.txt - abstract] [.ps]

J. Camenisch, Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem [.ps], Vol. 2 of ETH-Series in Information Security and Cryptography, ISBN 3-89649-286-1, Hartung-Gorre Verlag, Konstanz, 1998, 174 pages. [.ps] [.ps.gz]

J. Camenisch, J.-M. Piveteau, and M. Stadler, Fair Anonyme Zahlungssysteme, Proceedings of GISI 95 - Herausforderungen eine globalen Informationsverbundes für die Informatik, Informatik aktuell, Springer Verlag, 1995, pp. 254-265. [.ps] [.ps.Z] [.ps.gz]

J. Camenisch, J.-M. Piveteau, and M. Stadler, An Efficient Fair Payment System, Proceedings of 3rd ACM Conference on Computer Communications Security, ACM press, March 1996, pp. 88-94. [.ps]

J. Camenisch and M. Michels, Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes [.ps], EUROCRYPT '99, LNCS v. 1592, pages 106-121, Springer Verlag, 1999. [.ps] [.ps.gz]

K. Candan, S. Jajodia, and V. Subrahmanian, Secure mediated databases, Proc. 12th Int'l. Conf. on Data Engineering, 1996, pp. 28-37. [.ps]

R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, Randomness vs. Fault-Tolerance, PODC 97. [.ps.Z]

R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multi-party Computation; TR-682, LCS/MIT, 1996. [.ps]

R. Canetti, O. Goldreich, and S. Halevi, The Random Oracle Methodology, Revisited, March 1998.

R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, Multicast Security: A Taxonomy and Efficient Constructions, Proc. INFOCOM '99, Vol. 2, pp. 708-716, March 1999. [.ps]

R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Adaptive Security for Threshold Cryptosystems, Proc. Advances in Cryptology - CRYPTO '99, Michael Wiener (Ed.), LNCS (1666), Springer-Verlag, August 1999. (This is an extended version.) [.ps.gz]

R. Canetti and O. Goldreich, Bounds on Tradeoffs between Randomness and Communication Complexity; August 1990. [.ps]

R. Canetti, O. Goldreich, and S. Halevi, The Random Oracle Methodology, Revisited, March 1998.

R. Canetti, S. Halevi, and A. Herzberg, How to Maintain Authenticated Communication in the Presence of Break-ins, PODC '97. Preliminary version available as Theory of Cryptography Library: Record Arc-02.

R. Canetti and R. Gennaro, Incoercible Multiparty Computation, 1996 IEEE Symposium on the Foundations of Computer Science (FOCS 96). [.ps.Z]

R. Canetti, G. Even, and O. Goldreich, Lower Bounds for Sampling Algorithms for Estimating the Average; October 1994. [.ps]

D. Catalano and R. Gennaro, New and Efficient Protocols for Verifiable Signature Sharing and Other Applications, CRYPTO '98. [.ps]

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The Random Oracle Hypothesis is False; July 1992. [.ps]

S. Chari, C. Jutla, J. Rao, and P. Rohatgi, A Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards, presented at the Second AES Conference in Rome, 1999. [.ps]

D. Chaum, Achieving Electronic Privacy; Scientific American, August 1992, pp. 96-101

D. Chaum, C. Crépeau, and I. Damgaard, Multiparty unconditionally secure protocols; In 19th Symp. on Theory of Computing, pages 11-19. ACM, 1988. [.ps.gz]

D. Chaum, Prepaid Smart Card Techniques. A Brief Introduction and Comparison; 1993

D. Chaum, Online Cash Checks; Advances in Cryptology, EUROCRYPT 89, Springer-Verlag, pp. 288-293.

D. Chaum, Security Without Identification: Card Computers to Make Big Brother Obsolete, Communications of the ACM, vol. 28 no. 10, October 1985 pp. 1030-1044; Revised version (in Dutch) Informatie, pp. 213, 1987. Extended and revised version: Subtitled "Card Computers to Make Big Brother Obsolete" (in German), Informatik-Spektrum, vol. 10, pp. 262-277 1987; & Datenschutz und Datensicherung, no. 1, 1988, pp. 26-41.

D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer; Interner Bericht 1/91, Fakultät für Informatik, Universität Karlsruhe, February 1991. [.ps.gz]

D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer (Extended abstract); Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 470-484. [.ps.gz]

P. Chen, J. Garay, A. Herzberg, and H. Krawczyk, A Security Architecture for the Internet Protocol, IBM Systems Journal 37, No. 1 (1998).

P. Cheng, J. Garay, A. Herzberg, and H. Krawczyk, Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX, Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, Utah, June 1995. [.ps]

P. Chodowiec and K. Gaj, Implementation of the Twofish Cipher Using FPGA Devices, Technical Report, Electrical and Computer Engineering, George Mason University, July 1999.

B. Chor and O. Goldreich, On the power of two-points based sampling; 1985. [.ps]

B. Chor and O. Goldreich, Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity; (file contains only Abstract and Introduction), 1986. [.ps]

B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIDMA 4(1), 1991, pp. 36-47. [.ps.Z]

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, FOCS 95. [.ps.Z]

B. Chor and R. Rivest, A Knapsack Type Cryptosystem Based on Arithmetic in Finite Fields; IEEE Trans. Information Theory 34,5 (Sep. 1988), 901--909. (Also in CRYPTO 84.) [.pdf]

B. Chor and E. Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition, IPL 45, 1993, pp. 205-210. [.ps.Z]

B. Chor, M. Gereb-Graus, and E. Kushilevitz, On the Structure of the Privacy Hierarchy, J. Cryptology 7(1), 1994, pp. 53-60. [.ps.Z]

B. Chor, M. Gereb-Graus, and E. Kushilevitz, Private Computations Over the Integers, SICOMP 24(2), 1995, pp. 376-386. [.ps.Z]

B. Chor and E. Kushilevitz, Secret Sharing Over Infinite Domains, J. Cryptology 6(2), 1993, pp. 87-96. Early version: Crypto 89. [.ps.Z]

B. Chor, J. Freidmann, O. Goldreich, J. Hastad, S. Rudich, and R. Smolensky, The Bit Extraction Problem or t-Resilient Functions; 1985. [.ps]

Y.-h. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, and M. Strauss, REFEREE: Trust Management for Web Applications, World Wide Web Journal, 2 (1997), pp. 127-139. Reprinted from Proceedings of the 6th International World Wide Web Conference, World Wide Web Consortium, Cambridge, 1997, pp. 227-238. [.ps]

L. Claesen, J. Daemen, M. Genoe, and G. Peeters, Subterranean: a 600 Mbit/sec cryptographic VLSI chip, Proceedings of ICCD '93: VLSI in Computers and Processors, R. Camposano, A. Domic, Eds., IEEE Computer Society Press, 1993, pp. 610-613. [.ps.gz]

J. Claessens, B. Preneel, and J. Vandewalle, Solutions for Anonymous Communication on the Internet, Proceedings of the IEEE 33rd Annual 1999 International Carnahan Conference on Security Technology (ICCST'99), pp 298-303. [.ps.gz]

J. Claessens, B. Preneel, and J. Vandewalle, Anonymity Controlled Electronic Payment Systems, Proceedings of the 20th Symposium on Information Theory in the Benelux, 1999, pp. 109-116. [.ps.gz]

J. Claessens, M. Vandenwauver, B. Preneel, and J. Vandewalle, Setting up a secure web server and clients on an Intranet, IEEE 7th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE'98), 1998, pp 295-300. [.ps.gz]

A. Clark, Data Security in X.25 Networks, Corporate Computer Security (Scotland), Edinburgh. [.pdf]

A. Clark, Secure Email, Fact or Fiction?, COSAC 97, Newcastle Co. Down. [.pdf]

A. Clark, Security Auditing, A Methodology, COSAC 97, Newcastle Co. Down. [.pdf]

A. Clark, Personal Authentication, an Update - presented to the Technology of Software Protection Group of the British Computer Society, London. [.pdf]

A. Clark, Key Recovery - Why, How, Who?, Compsec '97, London, Elsevier. [.pdf]

A. Clark, Cryptography in Great Britain, CNEJITA conference of experts, French Senate, Paris. [.pdf]

A. Clark, Crypto Toolkits -- Addressing Clients' Real Requirements, PKS '97, Toronto. [.pdf]

A. Clark, Cryptographic Controls, The Eternal Triangle, COMPSEC '96, London, Elsevier. [.pdf]

A. Clark, Security Technology and Electronic Commerce, Internet and Online Business Security, London. [.pdf]

A. Clark, Tamper Resistance and Cryptovariable Protection (updated paper), Corporate Computer Security, Brighton, from the original presented at Eurocrypt '87, Amsterdam. [.pdf]

J. Cohen, Improving Privacy in Cryptographic Elections, Yale University Department of Computer Science Technical Report number 454. February 1986. [.ps]

C. Colbourn, J. Dinitz, and D. Stinson, Quorum systems constructed from combinatorial designs; Submitted to Information and Computation. [.ps]

A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Random Debaters and the Hardness of Approximating Stochastic Functions; SIAM Journal on Computing, 26 (1997), pp. 369-400. Extended abstract appears in Proceedings of the 1994 IEEE Conference on Structure in Complexity Theory. [.ps]

A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Probabilistically Checkable Debate Systems and Nonapproximability Results for PSPACE-Hard Functions, Chicago Journal of Theoretical Computer Science, volume 1995, number 4.

D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in IBM Research Report RC 20318, December 27, 1995. [.ps]

D. Coppersmith, D. Wagner, B. Schneier, and J. Kelsey, Cryptanalysis of TwoPrime, Fast Software Encryption, Fifth International Workshop Proceedings (March 1998), Springer-Verlag, 1998, 32-48.

M. Coster, B. LaMacchia, A. Odlyzko, and C. Schnorr, An improved low-density subset sum algorithm, Advances in Cryptology - EUROCRYPT '91, D. W. Davies (ed.), Springer Verlag, Lecture Notes in Computer Science #547 (1991), pp. 54-67. [.pdf] [.ps]

M. Coster, A. Joux, B. LaMacchia, A. Odlyzko, C. Schnorr, and J. Stern, Improved low-density subset sum algorithms, Computational Complexity 2 (1992), pp. 111-128. [.pdf] [.ps]

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based Digital Signature Scheme, Asiacrypt 2001. Preprint published as Inria rapport de recherche 4118, February 2001.

N. Courtois, The security of Hidden Field Equations (HFE), Topics in Cryptology - CT-RSA 2001: The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings, LNCS2020, Springer-Verlag. [.pdf] [.ps]

N. Courtois, Efficient Zero-knowledge authentication based on a linear algebra problem MinRank, Asiacrypt 2001. [.pdf] [.ps]

N. Courtois, The Security of Cryptographic Primitives Based on Multivariate Algebraic Problems: MQ, MinRank, IP, HFE. PhD thesis, Paris 6 university, September 25th 2001. In French. [.pdf]

C. Crépeau, What is going on with Quantum Bit Commitment?; invited paper in Proceedings of Pragocrypt '96, Czech Technical University Publishing House, Prague, pages 193-203, 1996. [.ps.gz]

C. Crépeau, Verifiable disclosure of secrets and applications; In Advances in Cryptology: Proceedings of Eurocrypt '89, volume 434 of Lecture Notes in Computer Science, pages 181-191. Springer-Verlag, 1990. [.ps.gz]

C. Crépeau, A zero-knowledge poker protocol that achieves confidentiality of the players' strategy or how to achieve an electronic poker face; In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of Lecture Notes in Computer Science, pages 239-247. Springer, 1987. [.ps.gz]

C. Crépeau, A secure poker protocol that minimizes the effects of player coalitions; In Advances in Cryptology: Proceedings of Crypto '85, vol 218 of LNCS pages 73-86. Springer, 1986. [.ps.gz]

C. Crépeau and J. Kilian, Weakening security assumptions and oblivious transfer; In S. Goldwasser, editor, Advances in Cryptology: Proceedings of Crypto '88, volume 403 of Lecture Notes in Computer Science, pages 2-7. Springer-Verlag, 1990. [.ps.gz]

C. Crépeau, Quantum Oblivious Transfer, Journal of Modern Optics, v. 41, n. 12, December 1994, pp. 2445-2454. [.ps]

C. Crépeau, J. van de Graaf, and A. Tapp, Committed Oblivious Transfer and Private Multi-Party Computations; Advances in Cryptology: Proceedings of Crypto '95, Springer-Verlag, pages 110-123, 1995. [.ps.gz]

C. Crépeau, Cryptographic primitives and quantum theory; In Proceedings of the second Physics of Computation Workshop, PhysComp '92, pages 200-204, 1993. [.ps.gz]

C. Crépeau, calcul partagé à base d'encryption probabiliste; Prepared for the "Camps Mathématique", AMQ, 2 pages, June 1996. [.ps.gz]

C. Crépeau and L. Salvail, Oblivious Verification of Common String, CWI Quarterly, v. 8, n. 2, June 1995, pp. 97-109. [.ps]

C. Crépeau, La cryptographie : pour que les secrets le restent; Les grands Dossiers, "Nouvelles Technologies de l'information", CyberSciences, June 1997.

C. Crépeau, Réconcilliation et Distillation publiques de secret; unpublished manuscript, 13 pages, 1995. [.ps.gz]

C. Crépeau and J. Kilian, Discreet solitary games; In Advances in Cryptology: Proceedings of Crypto '93, Lecture Notes in Computer Science. Springer-Verlag, pages 319-330,1993. [.ps.gz]

C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions; In 29th Symp. on Found. of Computer Sci., pages 42-52. IEEE, 1988. [.ps.gz]

C. Crépeau, Protocole cryptographique de poker à l'aveugle permettant la confidentialité de la stratégie; Master's thesis, Département d'Informatique et de R.O., Université de Montréal, 1986. Supervised by G. Brassard. [.ps.gz]

C. Crépeau and M. Sántha, On the reversibility of oblivious transfer; In Advances in Cryptology: Proceedings of Eurocrypt '91, volume 547 of Lecture Notes in Computer Science, pages 106-113. Springer-Verlag, 1991. [.ps.gz]

C. Crépeau, Efficient Cryptographic Protocols Based on Noisy Channels; Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pages 306-317, 1997. [.ps.gz]

C. Crépeau and M. Sántha, Efficient reductions among oblivious transfer protocols based on new self-intersecting codes; In Sequences II, Methods in Communications, Security, and Computer Science, pages 360-368. Springer-Verlag, 1991. [.ps.gz]

C. Crépeau and L. Salvail, Quantum Oblivious Mutual Identification; Advances in Cryptology: Proceedings of Eurocrypt '95, Springer-Verlag, pages 133-147, 1995. [.ps.gz]

C. Crépeau, Correct and Private Reductions among Oblivious Transfers; PhD thesis, Department of Elec. Eng. and Computer Science, Massachusetts Institute of Technology, 1990. Supervised by Silvio Micali. [.ps.gz]

C. Crépeau, Equivalence between two flavours of oblivious transfers (abstract); In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto '87, volume 293 of Lecture Notes in Computer Science, pages 350-354. Springer-Verlag, 1988. [.ps.gz]

R. Cramer, I. Damgård, and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. [.ps.Z]

R. Cramer and T. Pedersen, Efficient and provable security amplifications. [.ps.Z]

R. Cramer, Introduction to Secure Computation, Lectures on Data Security - Modern Cryptology in Theory and Practice, Springer LNCS Tutorial, vol.1561, March 1999, pp. 16-62. New version, August 18th, 1999. [.ps]

R. Cramer, I. Damgård, and U. Maurer, General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme, manuscript, Jan. 1999. Older version: BRICS Report Series RS-97-28, available from http://www.brics.dk, 1997.

R. Cramer and I. Damgård, Linear Zero-Knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments, Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC '97), El Paso, Texas, ACM Press, pp. 436-445. [.ps]

R. Cramer, R. Gennaro, and B. Schoemakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EUROCRYPT '97, Springer-Verlag, LNCS 1233, pp.103-118. Also in European Transactions on Telecommunications. [.ps]

R. Cramer, I. Dåard, S. Dziembowski, M. Hirt, and T. Rabin, Efficient multiparty computations secure against an adaptive adversary, Advances in Cryptology -- EUROCRYPT '99, LNCS v. 1592, 1999, pp. 309-323. [.ps.gz]

R. Cramer, On shared randomness and the size of secure signatures. [.ps.Z]

R. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme; Appears in European Transactions of Telecommunications Vol.8, No.5. A preliminary version appears at EUROCRYPT'97. [.ps]

R. Cramer and T. Pedersen, Improved Privacy in Wallets with Observers, Proceedings of EUROCRYPT '93, Lofthus, Norway, Springer Verlag LNCS, vol. 765, pp. 329-343. [.ps]

R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, Preprint, 1998. [.ps.Z]

R. Cramer and I. Damgård, New Generation of Secure and Practical RSA-based Signatures, CRYPTO '96, Springer Verlag LNCS, vol. 1109, pp. 173--185 [.ps]

R. Cramer and I. Damgård, Zero-Knowledge for Finite Field Arithmetic. Or: Can Zero-Knowledge be for Free?, Proceedings of CRYPTO '98, Springer Verlag LNCS, vol. 1462, pp. 424-441, 1998. [.ps]

R. Cramer, B. Schoenmakers, and M. Yung, Multi-authority secret ballot elections with linear work, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in CWI Research Report CS-R9571, January 1996. [.ps]

L. Cranor and R. Cytron, Sensus: A Security-Conscious Electronic Polling System for the Internet, Proceedings of the Hawai`i International Conference on System Sciences, January 7-10, 1997, Wailea, Hawai`i, USA.

A. Cresti and P. Béguin, General Short Computational Secret Sharing Scheme, Advances in Cryptology -- Proceedings of Eurocrypt '95. [.pdf]

B. Crispo, M. Lomas, A Certification Scheme for Electronic Commerce, Proceedings of the Security Protocols International Workshop, April 10-12, 1996, Cambridge, UK, Springer-Verlag LNCS series vol. 1189 pp. 19-32.

P. Crowley, Mercy: a fast large block cipher for disk sector encryption, Proceedings of Fast Software Encryption 2000, Springer-Verlag, 2000.

D. Currie and C. Irvine, Surmounting the Effects of Lossy Compression on Steganography, Proceedings of the 19th National Information System Security Conference, Baltimore, MD, October 1996, pp. 194-201. [.pdf]

Schneier.com is a personal website. Opinions expressed are not necessarily those of BT Counterpane.