Christian Cachin - Publications

Recent and Unpublished Work

Refereed Journal Papers

[1]

Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology, 18(3):219-246, 2005. Preliminary version appears in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000). Copyright © IACR. (PDF) (PS) (GZIP)

[2]

Christian Cachin. An information-theoretic model for steganography. Information and Computation, 192(1):41-56, July 2004. Parts of this paper appeared in Proc. 2nd Workshop on Information Hiding, Springer, 1998. (PDF) (PS) (GZIP)

[3]

Christian Cachin and Ueli Maurer. Linking information reconciliation and privacy amplification. Journal of Cryptology, 10(2):97-110, 1997. Preliminary version appears in Proc. EUROCRYPT '94. (PS) (GZIP)

[4]

Christian Cachin and Hans Jürg Wiesmann. PD recognition with knowledge-based preprocessing and neural networks. IEEE Transactions on Dielectrics and Electrical Insulation, 2(4):578-589, 1995. Copyright © IEEE.

[5]

Christian Cachin. Pedagogical pattern selection strategies. Neural Networks, 7(1):175-181, 1994.

Refereed Conference Papers

[1]

Christian Cachin, abhi shelat, and Alexander Shraer. Efficient fork-linearizable access to untrusted shared memory. In Proc. 26th ACM Symposium on Principles of Distributed Computing (PODC 2007), pages 129-138, August 2007. Copyright © ACM. (PDF) (GZIP)

[2]

Roman Pletka and Christian Cachin. Cryptographic security for a high-performance distributed file system. In Proc. 24th IEEE Conf. on Mass Storage Systems and Technologies (MSST), pages 227-232, September 2007. Extended version available as IBM Research Report RZ 3661. (PDF) (GZIP)

[3]

HariGovind V. Ramasamy and Christian Cachin. Parsimonious asynchronous Byzantine-fault-tolerant atomic broadcast. In J. H. Anderson, G. Prencipe, and R. Wattenhofer, editors, Proc. OPODIS 2005 --- 9th Intl. Conference on Principles of Distributed Systems, number 3974 in Lecture Notes in Computer Science, pages 88-102. Springer, 2006. Copyright © Springer-Verlag. (PDF) (GZIP)

[4]

Michael Backes, Christian Cachin, and Alina Oprea. Lazy revocation in cryptographic file systems. In Proc. 3rd Intl. IEEE Security in Storage Workshop, pages 1-11, December 2005. Copyright © IEEE. (PDF) (GZIP)

[5]

Michael Backes, Christian Cachin, and Alina Oprea. Secure key-updating for lazy revocation. In D. Gollmann, J. Meier, and A. Sabelfeld, editors, Proc. 11th European Symposium On Research In Computer Security (ESORICS), number 4189 in Lecture Notes in Computer Science, pages 327-346. Springer, 2006. Copyright © Springer-Verlag. (PDF) (GZIP)

[6]

Christian Cachin and Stefano Tessaro. Optimal resilience for erasure-coded Byzantine distributed storage. In Proc. International Conference on Dependable Systems and Networks (DSN-2006), pages 115-124, 2006. Copyright © IEEE. (PDF) (PS) (GZIP)

[7]

Michael Backes and Christian Cachin. Public-key steganography with active attacks. In Joe Kilian, editor, Proc. 2nd Theory of Cryptography Conference (TCC 2005), volume 3378 of Lecture Notes in Computer Science, pages 210-226. Springer, 2005. (PDF) (PS) (GZIP)

[8]

Christian Cachin and Stefano Tessaro. Asynchronous verifiable information dispersal. In Proc. 24th Symposium on Reliable Distributed Systems (SRDS 2005), pages 191-202, October 2005. Copyright © IEEE. (PDF) (PS) (GZIP)

[9]

Christian Cachin and Reto Strobl. Asynchronous group key exchange with failures. In Proc. 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), pages 357-366, July 2004. Copyright © ACM. (PDF) (PS) (GZIP)

[10]

Christian Cachin and Asad Samar. Secure distributed DNS. In Proc. Intl. Conference on Dependable Systems and Networks (DSN-2004), pages 423-432, June 2004. Copyright © IEEE. (PDF) (PS) (GZIP)

[11]

Christian Cachin. An asynchronous protocol for distributed computation of RSA inverses and its applications. In Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 153-162, July 2003. Copyright © ACM. (PDF) (PS) (GZIP)

[12]

Michael Backes, Christian Cachin, and Reto Strobl. Proactive secure message transmission in asynchronous networks. In Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 223-232, July 2003. Copyright © ACM. (PS) (GZIP)

[13]

Michael Backes and Christian Cachin. Reliable broadcast in a computational hybrid model with Byzantine faults, crashes, and recoveries. In Proc. Intl. Conference on Dependable Systems and Networks (DSN-2003), pages 37-46, June 2003. Copyright © IEEE. (PDF) (PS) (GZIP)

[14]

Christian Cachin. Modeling complexity in secure distributed computing. In André Schiper, Alexander A. Shvartsman, Hakim Weatherspoon, and Ben Y. Zhao, editors, Future Directions in Distributed Computing, volume 2584 of Lecture Notes in Computer Science, pages 57-61. Springer, 2003. Copyright © Springer-Verlag. (PDF) (PS) (GZIP)

[15]

Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, and Reto Strobl. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proc. 9th ACM Conference on Computer and Communications Security (CCS), pages 88-97, 2002. Copyright © IEEE. (PDF) (PS) (GZIP)

[16]

Christian Cachin and Jonathan A. Poritz. Secure intrusion-tolerant replication on the Internet. In Proc. Intl. Conference on Dependable Systems and Networks (DSN-2002), pages 167-176, June 2002. Copyright © IEEE. (PDF) (PS) (GZIP)

[17]

Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols (extended abstract). In Joe Kilian, editor, Advances in Cryptology: CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 524-541. Springer, 2001. Full version available as Cryptology ePrint Archive, Report 2001/006, url http://eprint.iacr.org/. Copyright © IACR. (PDF) (PS) (GZIP)

[18]

Christian Cachin. Distributing trust on the Internet. In Proc. Intl. Conference on Dependable Systems and Networks (DSN-2001), pages 183-192, June 2001. Copyright © IEEE. (PDF) (PS) (GZIP)

[19]

Joy Algesheimer, Christian Cachin, Jan Camenisch, and Günter Karjoth. Cryptographic security for mobile code. In Proc. IEEE Symposium on Security and Privacy (S&P 2001), pages 2-11, May 2001. Copyright © IEEE. (PDF) (PS) (GZIP)

[20]

Christian Cachin and Jan Camenisch. Optimistic fair secure computation. In Mihir Bellare, editor, Advances in Cryptology: CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 94-112. Springer, 2000. Copyright © IACR. (PDF) (PS) (GZIP)

[21]

Christian Cachin, Jan Camenisch, Joe Kilian, and Joy Müller. One-round secure computation and secure autonomous mobile agents. In Ugo Montanari, José P. Rolim, and Emo Welzl, editors, Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 512-523. Springer, 2000. Copyright © Springer-Verlag. (PDF) (PS) (GZIP)

[22]

Christian Cachin. Efficient private bidding and auctions with an oblivious third party. In Proc. 6th ACM Conference on Computer and Communications Security, pages 120-127, 1999. Copyright © ACM. (PDF) (PS) (GZIP)

[23]

Christian Cachin, Silvio Micali, and Markus Stadler. Computationally private information retrieval with polylogarithmic communication. In Jacques Stern, editor, Advances in Cryptology: EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 402-414. Springer, 1999. Copyright © IACR. (PDF) (PS) (GZIP)

[24]

Christian Cachin, Claude Crépeau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 493-502, 1998. Copyright © IEEE. (PS) (GZIP)

[25]

Christian Cachin. An information-theoretic model for steganography. In David Aucsmith, editor, Information Hiding, 2nd International Workshop, volume 1525 of Lecture Notes in Computer Science, pages 306-318. Springer, 1998. Revised version appears in Information and Computation, 2004.

[26]

Christian Cachin. On the foundations of oblivious transfer. In Kaisa Nyberg, editor, Advances in Cryptology: EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 361-374. Springer, 1998. (PS) (GZIP)

[27]

Christian Cachin and Ueli Maurer. Unconditional security against memory-bounded adversaries. In Burt Kaliski, editor, Advances in Cryptology: CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 292-306. Springer, 1997. (PS) (GZIP)

[28]

Christian Cachin. Smooth entropy and Rényi entropy. In Walter Fumy, editor, Advances in Cryptology: EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 193-208. Springer, 1997. (PS) (GZIP)

[29]

Christian Cachin. On-line secret sharing. In Colin Boyd, editor, Cryptography and Coding: 5th IMA Conference, Cirencester, UK, volume 1025 of Lecture Notes in Computer Science, pages 190-198. Springer, 1995. (PS) (GZIP)

[30]

Matthias Rauterberg and Christian Cachin. Locating the primary attention focus of the user. In Thomas Grechenig and Manfred Tscheligi, editors, Vienna Conference on Human Computer Interaction, volume 733 of Lecture Notes in Computer Science, pages 129-140. Springer, 1993. (PDF)

Books and Book Chapters

[1]

Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, editors. Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland, July 2007, volume 4596 of Lecture Notes in Computer Science. Springer, 2007.

[2]

Christian Cachin and Jan Camenisch, editors. Advances in Cryptology --- EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science. Springer, 2004.

[3]

Christian Cachin. Digital steganography. In Henk C.A. van Tilborg, editor, Encyclopedia of Cryptography and Security. Springer, 2005. (PDF) (PS) (GZIP)

Other Published Work

[1]

Christian Cachin. Cryptographic methods for protecting storage systems. Tutorial, presented at 6th USENIX Conference on File and Storage Technologies (FAST '08), at 24th IEEE Conf. on Mass Storage Systems and Technologies (MSST 2007), and at 13th ACM Conference on Computer and Communications Security (CCS 2006), 2008. (PDF)

[2]

Paulo Veríssimo, Nuno F. Neves, Christian Cachin, Jonathan Poritz, David Powell, Yves Deswarte, Robert Stroud, and Ian Welch. Intrusion-tolerant middleware. IEEE Security & Privacy Magazine, 4(4):88-102, July 2006. Copyright © Springer-Verlag.

[3]

Christian Cachin and Stefano Tessaro. Brief Announcement: Optimal resilience for erasure-coded Byzantine distributed storage. In Pierre Fraigniaud, editor, Proc. 19th International Conference on Distributed Computing (DISC 2005), September 26-29, 2005, Cracow, Poland, volume 3724 of Lecture Notes in Computer Science, pages 497-498. Springer, 2005.

[4]

Christian Cachin and Stefano Tessaro. Brief Announcement: Asynchronous verifiable information dispersal. In Pierre Fraigniaud, editor, Proc. 19th International Conference on Distributed Computing (DISC 2005), September 26-29, 2005, Cracow, Poland, volume 3724 of Lecture Notes in Computer Science, pages 503-504. Springer, 2005.

[5]

Christian Cachin. Hashing a source with an unknown probability distribution. Manuscript (Abstract in Proc. 1998 IEEE International Symposium on Information Theory, Boston), 1998. (PS) (GZIP)

[6]

Christian Cachin and Ueli Maurer. Smoothing probability distributions and smooth entropy. Manuscript (Abstract in Proc. 1997 IEEE International Symposium on Information Theory, Ulm), 1997. (PS) (GZIP)

[7]

Christian 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, Ref. Prof. U. Maurer, Co-Ref. Prof. J.L. Massey).

[8]

Christian Cachin and Ueli Maurer. Sicherheit im Internet: Illusion oder Realität? INFORMATIK / INFORMATIQUE, 2(2):18-23, 1995. (PS) (GZIP)

Copyright Notices

IACR Copyright Notice:

Permission is granted for a user to display all material at this site, to copy the material onto a single computer, and to make print copies of the material for personal use only. All other rights are retained by the International Association for Cryptologic Research. In particular, any other copying, other redistribution, or any commercial use of the material requires the permission of the publisher, which may be requested by contacting the International Association for Cryptologic Research.

IEEE Copyright Notice:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. ACM Copyright Notice

ACM Copyright Notice:

ACM COPYRIGHT NOTICE. Copyright © 1999-2004 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice:

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.