Christian Cachin - Publications

Last update Thursday, 05-Jan-2017 22:53:36 CET. Please note the copyright statement.

Recent and Unpublished Work

[1]
Marcus Brandenburger, Christian Cachin, Matthias Lorenz, and Rüdiger Kapitza. Rollback and forking detection for trusted execution environments using lightweight collective memory. e-print, arXiv:1701.00981 [cs.DC], 2017.

Journal Papers

[1]
Tobias Distler, Christian Cachin, and Rüdiger Kapitza. Resource-efficient Byzantine fault tolerance. IEEE Transactions on Computers, 65(9):2807-2819, 2016.

[2]
Christian Cachin, Claude Crépeau, Julien Marcil, and George Savvides. Information-theoretic interactive hashing and oblivious transfer to a storage-bounded receiver. IEEE Transactions on Information Theory, (10):5623-5635, October 2015.

[3]
Christian Cachin, Idit Keidar, and Alexander Shraer. Fail-aware untrusted storage. SIAM Journal on Computing, 40(2):493-533, April 2011. Preliminary version appears in Proc. DSN 2009. (PDF)

[4]
Christian Cachin, Idit Keidar, and Alexander Shraer. Fork sequential consistency is blocking. Information Processing Letters, 109(7):360-364, March 2009. (PDF) (GZIP)

[5]
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). Copyright © IACR. (PDF) (PS) (GZIP)

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

[7]
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)

[8]
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.

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

Conference Papers

[1]
Christian Cachin, Simon Schubert, and Marko Vukolic. Non-determinism in Byzantine fault-tolerant replication. In Proc. 20th International Conference on Principles of Distributed Systems (OPODIS), volume 46. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016. To appear. Preliminary version appears as arXiv:1603.07351 [cs.DC], url http://arxiv.org/abs/1603.07351, 2016. (PDF)

[2]
Shengyun Liu, Christian Cachin, Vivien Quéma, and Marko Vukolic. XFT: Practical fault tolerance beyond crashes. In Kimberly Keeton and Timothy Roscoe, editors, Proc. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI), November 2016.

[3]
Marcus Brandenburger, Christian Cachin, and Nikola Knezevic. Don't trust the cloud, verify: Integrity and consistency for cloud object stores. In Dalit Naor, Gernot Heiser, and Idit Keidar, editors, Proc. 8th ACM International Systems and Storage Conference (SYSTOR), page 16. ACM, May 2015. (PDF)

[4]
Elli Androulaki, Christian Cachin, Dan Dobre, and Marko Vukolic. Erasure-coded Byzantine storage with separate metadata. In Marcos K. Aguilera, Leonardo Querzoni, and Marc Shapiro, editors, Proc. 18th International Conference on Principles of Distributed Systems (OPODIS), volume 8878 of Lecture Notes in Computer Science, pages 76-90. Springer, 2014. Preliminary version appears as arXiv:1402.4958 [cs.DC], url http://arxiv.org/abs/1402.4958, 2014. Copyright © Springer. (PDF)

[5]
Christian Cachin and Olga Ohrimenko. Verifying the consistency of remote untrusted services with commutative operations. In Marcos K. Aguilera, Leonardo Querzoni, and Marc Shapiro, editors, Proc. 18th International Conference on Principles of Distributed Systems (OPODIS), volume 8878 of Lecture Notes in Computer Science, pages 1-16. Springer, 2014. Preliminary version appears as arXiv:1302.4808 [cs.DC], url http://arxiv.org/abs/1302.4808, 2013. Copyright © Springer. (PDF)

[6]
Christian Cachin, Dan Dobre, and Marko Vukolic. Separating data and control: Asynchronous BFT storage with 2t+1 data replicas. In Proc. 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), volume 8756 of Lecture Notes in Computer Science, pages 1-17. Springer, 2014. Copyright © Springer. (PDF)

[7]
Christian Cachin, Kristiyan Haralambiev, Hsu-Chun Hsiao, and Alessandro Sorniotti. Policy-based secure deletion. In Proc. 20th ACM Conference on Computer and Communications Security (CCS), 2013. Copyright © ACM. (PDF)

[8]
Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. CheapBFT: Resource-efficient Byzantine fault tolerance. In Proc. 7th European Conference on Computer Systems (EuroSys), pages 295-308, April 2012. Copyright © ACM. (PDF)

[9]
Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas, Alessandro Sorniotti, Marko Vukolic, and Ido Zachevsky. Robust data sharing with key-value stores. In Proc. Intl. Conference on Dependable Systems and Networks (DSN), June 2012. Preliminary version appears as IBM Research Report RZ 3802, 2011. Copyright © IEEE. (PDF)

[10]
Matthias Majuntke, Dan Dobre, Christian Cachin, and Neeraj Suri. Fork-consistent constructions from registers. In Antonio Fernández Anta, Giuseppe Lipari, and Matthieu Roy, editors, Proc. 15th Intl. Conference on Principles of Distributed Systems (OPODIS), volume 7109 of Lecture Notes in Computer Science, pages 283-298. Springer, December 2011. Copyright © Springer. (PDF)

[11]
Anil Kurmus, Moitrayee Gupta, Roman Pletka, Christian Cachin, and Robert Haas. A comparison of secure multi-tenancy architectures for filesystem storage clouds. In Fabio Kon and Anne-Marie Kermarrec, editors, Proc. 12th International Middleware Conference, volume 7049 of Lecture Notes in Computer Science, pages 471-490. Springer, December 2011. Copyright © ACM. (PDF)

[12]
Christian Cachin. Integrity and consistency for untrusted services. In Ivana Cerná et al., editors, Proc. 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), volume 6543 of Lecture Notes in Computer Science, pages 1-14. Springer, 2011. Copyright © Springer. (PDF)

[13]
Alexander Shraer, Christian Cachin, Asaf Cidon, Idit Keidar, Yan Michalevsky, and Dani Shaket. Venus: Verification for untrusted cloud storage. In Proc. Workshop on Cloud Computing Security. ACM, 2010. Copyright © ACM. (PDF)

[14]
Mathias Björkqvist, Christian Cachin, Robert Haas, Xiao-Yu Hu, Anil Kurmus, René Pawlitzek, and Marko Vukolic. Design and implementation of a key-lifecycle management system. In Radu Sion, editor, Proc. Financial Cryptography and Data Security (FC 2010), volume 6052 of Lecture Notes in Computer Science, pages 160-174. Springer, 2010. Copyright © Springer. (PDF)

[15]
Christian Cachin, Idit Keidar, and Alexander Shraer. Fail-aware untrusted storage. In Proc. Intl. Conference on Dependable Systems and Networks (DSN), pages 494-503, June 2009. (PDF)

[16]
Christian Cachin and Nishanth Chandran. A secure cryptographic token interface. In Proc. Computer Security Foundations Symposium (CSF-22), pages 141-153. IEEE, July 2009. (PDF)

[17]
Christian Cachin and Martin Geisler. Integrity protection for revision control. In Michel Abdalla and David Pointcheval, editors, Proc. Applied Cryptography and Network Security (ACNS), volume 5536 of Lecture Notes in Computer Science, pages 382-399. Springer, 2009. Copyright © Springer. (PDF)

[18]
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), pages 129-138, August 2007. Copyright © ACM. (PDF) (GZIP)

[19]
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. Copyright © IEEE. (PDF) (GZIP)

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

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

[22]
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. (PDF) (GZIP)

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

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

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

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

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

[28]
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), pages 153-162, July 2003. Copyright © ACM. (PDF) (PS) (GZIP)

[29]
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), pages 223-232, July 2003. Copyright © ACM. (PS) (GZIP)

[30]
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), pages 37-46, June 2003. Copyright © IEEE. (PDF) (PS) (GZIP)

[31]
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. (PDF) (PS) (GZIP)

[32]
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 © ACM. (PDF) (PS) (GZIP)

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

[34]
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)

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

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

[37]
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)

[38]
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. (PDF) (PS) (GZIP)

[39]
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)

[40]
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)

[41]
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)

[42]
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.

[43]
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)

[44]
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)

[45]
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)

[46]
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)

[47]
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)

Proceedings, Books and Book Chapters

[1]
Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru, editors. Principles of Distributed Systems, 19th International Conference (OPODIS 2015), volume 46 of LIPIcs. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.

[2]
Christian Cachin and Robbert van Renesse, editors. Proc. 9th Workshop on Hot Topics in Dependable Systems (HotDep), Farmington (PA), USA. ACM, November 2013.

[3]
Christian Cachin, Rachid Guerraoui, and Luís Rodrigues. Introduction to Reliable and Secure Distributed Programming (Second Edition). Springer, 2011.

[4]
Christian Cachin. State machine replication with Byzantine faults. In Bernadette Charron-Bost, Fernando Pedone, and André Schiper, editors, Replication: Theory and Practice, volume 5959 of Lecture Notes in Computer Science, pages 169-184. Springer, 2010. (PDF)

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

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

[7]
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. Architecture of the Hyperledger blockchain fabric. Workshop on Distributed Cryptocurrencies and Consensus Ledgers (DCCL 2016), 2016.

[2]
Christian Cachin. Integrity, consistency, and verification of remote computation. Tutorial, presented at 21st ACM Conference on Computer and Communications Security (CCS 2014) and 18th International Conference on Principles of Distributed Systems (OPODIS 2014), 2014. (PDF)

[3]
Roland A. Burger, Christian Cachin, and Elmar Husmann. Cloud, trust, privacy: Trustworthy cloud computing whitepaper. Published by the TClouds project, available online at url http://www.tclouds-project.eu, 2013. (PDF)

[4]
Christian Cachin, Dan Dobre, and Marko Vukolic. Brief Announcement: BFT storage with 2t+1 data replicas. In Yehuda Afek, editor, Proc. 27th International Conference on Distributed Computing (DISC), volume 8205 of Lecture Notes in Computer Science, pages 573-574. Springer, 2013.

[5]
Christian Cachin. From reliable to secure distributed programming. Tutorial, presented at the 42nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), June 2012.

[6]
Christian Cachin, Divay Bansal, and Günter Karjoth. Key management with policy-based access control. Presented at 6th International Workshop on Analysis of Security APIs, June 2012. (PDF)

[7]
Christian Cachin, Birgit Junker, and Alessandro Sorniotti. On limitations of using cloud storage for data replication. Proc. 6th Workshop on Recent Advances in Intrusion Tolerance and reSilience (WRAITS 2012), June 2012. (PDF)

[8]
Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas, and Marko Vukolic. Robust data sharing with key-value stores. In Proc. 30th ACM Symposium on Principles of Distributed Computing (PODC), June 2011. Copyright © ACM.

[9]
Christian Cachin and Matthias Schunter. A cloud you can trust. IEEE Spectrum, pages 28-32, December 2011.

[10]
Christian Cachin. Secure distributed programming. Tutorial, presented at the 18th ACM Conference on Computer and Communications Security (CCS), October 2011.

[11]
Christian Cachin. From reliable to secure distributed programming. Tutorial, presented at the 25th International Symposium on Distributed Computing (DISC), September 2011.

[12]
Christian Cachin. Protocols for secure cloud computing. Tutorial, presented at METIS-CTDS 2011, International Spring School on Distributed Systems, Marrakech, April 2011. (PDF)

[13]
Rüdiger Kapitza, Matthias Schunter, Christian Cachin, Klaus Stengel, and Tobias Distler. Storyboard: Optimistic deterministic multithreading. In Proc. 6th Workshop on Hot Topics in System Dependability, 2010. (PDF)

[14]
Christian Cachin and Jan Camenisch. Encrypting keys securely. IEEE Security & Privacy Magazine, 8(4):66-69, July/August 2010.

[15]
Christian Cachin. Yet another visit to Paxos. Research Report RZ 3754, IBM Research, November 2009. (PDF)

[16]
Christian Cachin. From Byzantine-tolerant to intrusion-safe services. Presented at Workshop on Theory and Practice of Byzantine Fault Tolerance (BFTW3), September 2009. (PDF)

[17]
Christian Cachin, Anil Kurmus, and Marko Vukolic. Strict access control in a key-management server. Presented at 3rd International Workshop on Analysis of Security APIs, July 2009. (PDF)

[18]
Christian Cachin. Rational protocols. Presented at Workshop on Open Research Problems in Network Security (iNetSec 2009), April 2009.

[19]
Christian Cachin, Idit Keidar, and Alexander Shraer. Trusting the cloud. SIGACT News, 40(2):80-86, June 2009. (PDF)

[20]
Christian Cachin, Idit Keidar, and Alexander Shraer. Principles of untrusted storage: A new look at consistency conditions. In Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC), page 426, August 2008. Copyright © ACM.

[21]
Christian Cachin, Idit Keidar, and Alexander Shraer. Improving efficiency and enhancing concurrency of untrusted storage. In Proc. 6th USENIX Conference on File and Storage Technologies (FAST), Work-in-Progress Report, February 2008.

[22]
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)

[23]
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.

[24]
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), volume 3724 of Lecture Notes in Computer Science, pages 497-498. Springer, 2005.

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

[26]
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)

[27]
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)

[28]
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). (PDF)

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


The complete publication list is also available.


Copyright Notices

Some material that is available from this page is copyrighted.

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.


Christian Cachin