Christian Cachin  Home/Search
Context Related
| inf.ethz.ch/research/pu...th12187.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inf.ethz.ch/research/publicati... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One of the most important properties of a cryptographic system is a proof of its security. In the present work, information-theoretic methods are used for proving the security of unconditionally secure cryptosystems. The security of such systems does not depend on unproven intractability assumptions. (Update)
Cited by: More
Information-Theoretic Conditions for - Two-Party Secure Function (2006) (Correct)
The Disparity between Work and Entropy in Cryptology - Pliam (1999) (Correct)
Secret-Key Agreement over Unauthenticated Public Channels -.. - Maurer, Wolf (2003) (Correct)
Similar documents (at the sentence level):
79.1%: Entropy Measures and Unconditional Security in Cryptography - Cachin (1997) (Correct)
8.6%: Unconditional Security Against Memory-Bounded Adversaries - Cachin, Maurer (1997) (Correct)
Active bibliography (related documents): More All
0.7: An Information-Theoretic Model for Steganography - Cachin (1998) (Correct)
0.6: Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997) (Correct)
0.6: Security Protocols with Isotropic Channels - Madhukar Anand Eric (Correct)
Similar documents based on text: More All
0.5: Generalized Modular Decompositions and the Recognition of Classes .. - Raschle (1999) (Correct)
0.4: On the Design of Analog VLSI Iterative Decoders - Lustenberger (2000) (Correct)
0.3: Separate Compilation and Module Extension - Crelier (1994) (Correct)
Related documents from co-citation: More All
10: Secret-key agreement over unauthenticated public channels { Part I: De nitions a.. - Maurer, Wolf - 2003
9: Privacy amplification by public discussions (context) - Charles, Gilles et al. - 1988
9: Secret key agreement by public discussion from common information - Maurer - 1993
BibTeX entry: (Update)
C. Cachin, Entropy Measures and Unconditional Security in Cryptography, vol. 1 of ETH Series in Information Security and Cryptography. Konstanz, Germany: Hartung-Gorre Verlag, 1997. ISBN 3-89649-185-7 (Reprint of Ph.D. dissertation No. 12187, ETH Zurich). http://citeseer.ist.psu.edu/cachin97entropy.html More
@misc{ cachin97entropy,
author = "C. Cachin",
title = "Entropy Measures and Unconditional Security in Cryptography",
text = "C. Cachin, Entropy Measures and Unconditional Security in Cryptography,
vol. 1 of ETH Series in Information Security and Cryptography. Konstanz,
Germany: Hartung-Gorre Verlag, 1997. ISBN 3-89649-185-7 (Reprint of Ph.D.
dissertation No. 12187, ETH Zurich).",
year = "1997",
url = "citeseer.ist.psu.edu/cachin97entropy.html" }
Citations (may not include all citations):2319 Elements of information theory (context) - Cover, Thomas - 1991
1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
1065 Handbook of applied cryptography (context) - Menezes, van Oorschot et al. - 1997
837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
645 How to share a secret (context) - Shamir - 1979
493 Communications of the ACM (context) - Valiant, of et al. - 1984
466 Probability and measure (context) - Billingsley - 1995
428 IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
248 An introduction to computational learning theory (context) - Kearns, Vazirani - 1994 ACM
241 Communication theory of secrecy systems (context) - Shannon - 1949
239 Cryptography: Theory and practice (context) - Stinson - 1995
223 Theory and practice of error control codes (context) - Blahut - 1983
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989 ACM
163 Principles and practice of information theory (context) - Blahut - 1987 ACM
150 Computational complexity (context) - Papadimitriou - 1994 ACM
128 Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1990 DBLP
120 Unbiased bits from sources of weak randomness and probabilis.. - Chor, Goldreich - 1985
97 A mathematical theory of communication (context) - Shannon - 1948
97 Pseudorandomness and cryptographic applications (context) - Luby - 1996
93 Generalized secret sharing and monotone functions (context) - Benaloh, Leichter - 1990 ACM DBLP
85 Construction of a pseudo-random generator from any one-way f.. - Hastad, Impagliazzo et al. - 1991
84 Simulating BPP using a general weak random source - Zuckerman - 1991 ACM DBLP
84 Simulating BPP using a general weak random source - Zuckerman - 1991 ACM DBLP
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
67 Experimental quantum cryptography - Bennett, Bessette et al. - 1992 ACM DBLP
66 Information theory: Coding theorems for discrete memoryless .. (context) - Csisz'ar, Korner - 1981
61 Expanders that beat the eigenvalue bound: Explicit construct.. - Wigderson, Zuckerman - 1995
60 Computing with very weak random sources - Srinivasan, Zuckerman - 1994 ACM DBLP
60 An explication of secret sharing schemes (context) - Stinson - 1992 ACM DBLP
57 Algorithms for quantum computation: Discrete log and factori.. - Shor - 1994
56 Information Processing Letters - Sarwate, on et al. - 1980
54 the size of shares for secret sharing schemes - Capocelli, De Santis et al. - 1992
53 Chernoff-Hoeffding bounds for applications with limited inde.. - Schmidt, Siegel et al. - 1995
52 The wire-tap channel (context) - Wyner - 1975
46 An optimal class of symmetric key generation systems (context) - Blom - 1985 ACM DBLP
44 Contemporary cryptology: The science of information integrit.. (context) - Simmons - 1991
40 Probability theory (context) - R'enyi - 1970 ACM
40 Tiny families of functions with random properties: A quality.. - Goldreich, Wigderson - 1996 ACM DBLP
38 On some methods for unconditionally secure key distribution .. - Stinson - 1996 DBLP
36 Personal Communication (context) - Rabin - 1997
36 A quantum bit commitment scheme provably unbreakable by both.. - Brassard, Cr'epeau et al. - 1993
31 Cryptographic hardness of distributionspecific learning (context) - Kharitonov - 1993
28 Extracting randomness: How and why --- a survey (context) - Nisan - 1996
27 An introduction to probability theory (context) - Feller - 1968
26 Approximation theory of output statistics (context) - Han, Verd'u - 1993
25 The codebreakers: The story of secret writing (context) - Kahn - 1967
24 Conditionally-perfect secrecy and a provably-secure randomiz.. - Maurer - 1992
20 The size of a share must be large (context) - Csirmaz - 1995 DBLP
20 A wideband all-optical WDM network (context) - Kaminow, Doerr et al. - 1996
18 Linking information reconciliation and privacy amplification - Cachin, Maurer - 1995 DBLP
18 Linking information reconciliation and privacy amplification - Cachin, Maurer - 1997 DBLP
16 The trouble with quantum bit commitment - Mayers - 1996
16 On extracting randomness from weak random sources (context) - Ta-Shma - 1996 DBLP
15 Unconditional security against memory-bounded adversaries - Cachin, Maurer - 1997 ACM DBLP
14 The strong secret key rate of discrete random triples - Maurer - 1994
13 An inequality on guessing and its application to sequential .. (context) - Arikan - 1996
13 Achieving oblivious transfer using weakened security assumpt.. - Cr'epeau, Kilian - 1989
11 Information-theoretically secure secret-key agreement by NOT.. - Maurer - 1997 DBLP
11 Secret-key reconciliation by public discussion - Brassard, Salvail - 1994
10 International Computer Science Institute (context) - Luby, Wigderson et al. - 1995
10 Interaction in key distribution schemes (context) - Beimel, Chor - 1994 ACM
9 Electronic Colloquium on Computational Complexity (context) - Goldreich, cryptography et al. - 1995
8 Generating random bits from an arbitrary source: Fundamental.. (context) - Vembu, Verd'u - 1995
8 Special issue on optical networks (context) - Cruz, Hill et al. - 1996
6 The Rip van Winkle cipher: A simple and provably computation.. (context) - Massey, Ingemarsson - 1985
6 Advances in Cryptology --- CRYPTO (context) - Blundo, De Santis et al. - 1993
6 Advances in Cryptology --- EUROCRYPT (context) - Cachin, entropy et al. - 1997
5 The intrinsic conditional mutual information and perfect sec.. - Maurer, Wolf - 1997
4 A unified and generalized treatment of authentication theory - Maurer - 1996
4 the foundations of information theory (context) - R'enyi - 1965
4 the secret-key rate of binary random variables - Gander, Maurer - 1994
3 Underwater quantum coding (context) - Muller, Zbinden et al. - 1995
3 IEEE Communications Magazine (context) - Seidman, wideband - 1996
3 Smoothing probability distributions and smooth entropy - Cachin, Maurer - 1997
3 Generalized cutoff rates and R'enyi's information measures (context) - Csisz'ar - 1995
3 Cryptology and Computational Number Theory (context) - Pomerance - 1990
3 Quantum information processing: Cryptography (context) - Spiller - 1996
3 Advances in Cryptology --- EUROCRYPT (context) - Brassard, Cr'epeau et al. - 1997
2 Contemporary Cryptology: The Science of Information Integrit.. (context) - Massey, cryptography et al. - 1991
2 A storage complexity based analogue of Maurer key establishm.. (context) - Mitchell - 1995 ACM DBLP
2 Applied Digital Information Theory (context) - Massey, for - 1993
2 Alfr'ed R'enyi: Selected papers (context) - Turan - 1976
2 Efficient cryptographic protocols based on noisy channels - Cr'epeau - 1997 DBLP
2 Handbook of Theoretical Computer Science (context) - Rivest - 1990 ACM
2 th Annual ACM Symposium on Theory of Computing (context) - Zuckerman, sampling et al. - 1996
2 Mathematics in science and engineering (context) - Acz'el, Dar'oczy et al. - 1975
2 distance with applications to information theory (context) - Gray, Neuhoff et al. - 1975
1 Multiple assignment scheme for secret sharing (context) - Ito, Saito et al. - 1993
1 A birthday solution for nonuniform birth frequencies (context) - Nunnikhoven - 1992
1 preliminary version presented at 25th STOC (context) - Nisan, Zuckerman et al. - 1995
1 IEEE International Symposium on Information Theory (context) - McEliece, Yu et al. - 1995
1 years of quantum cryptography (context) - Brassard, Cr'epeau - 1996
1 Theoretische Informatik II (context) - Maurer, for - 1995
1 th Berkeley Symposium on Mathematical Statistics and Probabi.. (context) - R'enyi, of et al. - 1961
1 IEEE International Symposium on Information Theory (context) - Massey, entropy - 1994
1 What is going on with quantum bit commitment (context) - Cr'epeau - 1996
1 Information measures and capacity of order ff for discrete m.. (context) - Arimoto - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.inf.ethz.ch/research/publications/data/diss/): More
Code-Generation On-the-Fly: A Key to Portable Software - Steffen, Franz (1994) (Correct)
Distributed Counting: How to Bypass Bottlenecks - Wattenhofer (1998) (Correct)
Spoken Document Retrieval Based on Phoneme Recognition - Wechsler (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC