![]() | 2009 | |
---|---|---|
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Martin Geisler: Integrity Protection for Revision Control. ACNS 2009: 382-399 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Nishanth Chandran: A Secure Cryptographic Token Interface. CSF 2009: 141-153 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Idit Keidar, Alexander Shraer: Fail-Aware Untrusted Storage. DSN 2009: 494-503 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Idit Keidar, Alexander Shraer: Fork sequential consistency is blocking. Inf. Process. Lett. 109(7): 360-364 (2009) |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Idit Keidar, Alexander Shraer: Trusting the cloud. SIGACT News 40(2): 81-86 (2009) |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Christian Cachin, Andrzej Tarlecki: Preface. Theor. Comput. Sci. 410(18): 1617 (2009) |
2008 | ||
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Idit Keidar, Alexander Shraer: Principles of untrusted storage: a new look at consistency conditions. PODC 2008: 426 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Idit Keidar, Alexander Shraer: Fork Sequential Consistency is Blocking CoRR abs/0805.2068: (2008) |
2007 | ||
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Felix C. Freiling, Jaap-Henk Hoepman: From Security to Dependability, 10.09. - 15.09.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Springer 2007 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Roman Pletka, Christian Cachin: Cryptographic Security for a High-Performance Distributed File System. MSST 2007: 227-232 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Abhi Shelat, Alexander Shraer: Efficient fork-linearizable access to untrusted shared memory. PODC 2007: 129-138 |
2006 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Stefano Tessaro: Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. DSN 2006: 115-124 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Backes, Christian Cachin, Alina Oprea: Secure Key-Updating for Lazy Revocation. ESORICS 2006: 327-346 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Felix C. Freiling, Jaap-Henk Hoepman: 06371 Abstracts Collection -- From Security to Dependability. From Security to Dependability 2006 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Felix C. Freiling, Jaap-Henk Hoepman: 06371 Executive Summary -- From Security to Dependability. From Security to Dependability 2006 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Paulo Veríssimo, Nuno Ferreira Neves, Christian Cachin, Jonathan A. Poritz, David Powell, Yves Deswarte, Robert J. Stroud, Ian Welch: Intrusion-tolerant middleware: the road to automatic security. IEEE Security & Privacy 4(4): 54-62 (2006) |
2005 | ||
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Stefano Tessaro: Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. DISC 2005: 497-498 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Stefano Tessaro: Asynchronous Verifiable Information Dispersal. DISC 2005: 503-504 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Backes, Christian Cachin, Alina Oprea: Lazy Revocation in Cryptographic File Systems. IEEE Security in Storage Workshop 2005: 1-11 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | HariGovind V. Ramasamy, Christian Cachin: Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast. OPODIS 2005: 88-102 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Stefano Tessaro: Asynchronous Veri.able Information Dispersal. SRDS 2005: 191-202 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Backes, Christian Cachin: Public-Key Steganography with Active Attacks. TCC 2005: 210-226 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Digital Steganography. Encyclopedia of Cryptography and Security 2005 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Klaus Kursawe, Victor Shoup: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography. J. Cryptology 18(3): 219-246 (2005) |
2004 | ||
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Jan Camenisch: Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings Springer 2004 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Asad Samar: Secure Distributed DNS. DSN 2004: 423-432 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Reto Strobl: Asynchronous group key exchange with failures. PODC 2004: 357-366 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: An information-theoretic model for steganography. Inf. Comput. 192(1): 41-56 (2004) |
2003 | ||
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Backes, Christian Cachin: Reliable Broadcast in a Computational Hybrid Model with Byzantine Faults, Crashes, and Recoveries. DSN 2003: 37-46 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Modeling Complexity in Secure Distributed Computing. Future Directions in Distributed Computing 2003: 57-61 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: An asynchronous protocol for distributed computation of RSA inverses and its applications. PODC 2003: 153-162 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Backes, Christian Cachin, Reto Strobl: Proactive secure message transmission in asynchronous networks. PODC 2003: 223-232 |
2002 | ||
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl: Asynchronous verifiable secret sharing and proactive cryptosystems. ACM Conference on Computer and Communications Security 2002: 88-97 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Jonathan A. Poritz: Secure Intrusion-tolerant Replication on the Internet. DSN 2002: 167-176 |
2001 | ||
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup: Secure and Efficient Asynchronous Broadcast Protocols. CRYPTO 2001: 524-541 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Distributing Trust on the Internet . DSN 2001: 183-192 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Joy Algesheimer, Christian Cachin, Jan Camenisch, Günter Karjoth: Cryptographic Security for Mobile Code. IEEE Symposium on Security and Privacy 2001: 2-11 |
2000 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Jan Camenisch: Optimistic Fair Secure Computation. CRYPTO 2000: 93-111 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller: One-Round Secure Computation and Secure Autonomous Mobile Agents. ICALP 2000: 512-523 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Klaus Kursawe, Victor Shoup: Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract). PODC 2000: 123-132 |
1999 | ||
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Efficient Private Bidding and Auctions with an Oblivious Third Party. ACM Conference on Computer and Communications Security 1999: 120-127 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Silvio Micali, Markus Stadler: Computationally Private Information Retrieval with Polylogarithmic Communication. EUROCRYPT 1999: 402-414 |
1998 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: On the Foundations of Oblivious Transfer. EUROCRYPT 1998: 361-374 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Claude Crépeau, Julien Marcil: Oblivious Transfer with a Memory-Bounded Receiver. FOCS 1998: 493-502 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: An Information-Theoretic Model for Steganography. Information Hiding 1998: 306-318 |
1997 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Ueli M. Maurer: Unconditional Security Against Memory-Bounded Adversaries. CRYPTO 1997: 292-306 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Smooth Entropy and Rényi Entropy. EUROCRYPT 1997: 193-208 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Ueli M. Maurer: Linking Information Reconciliation and Privacy Amplification. J. Cryptology 10(2): 97-110 (1997) |
1995 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: On-Line Secret Sharing. IMA Conf. 1995: 190-198 |
1994 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin, Ueli M. Maurer: Linking Information Reconciliation and Privacy Amplification (Extended Abstract). EUROCRYPT 1994: 266-274 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Cachin: Pedagogical pattern selection strategies. Neural Networks 7(1): 175-181 (1994) |
1993 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Matthias Rauterberg, Christian Cachin: Locating the Primary Attention Focus of the User. VCHCI 1993: 129-140 |