See this document in CiteSeerX!

Entropy Measures and Unconditional Security in Cryptography (1997)  (Make Corrections)  (20 citations)
Christian Cachin



  Home/Search   Context   Related

 
View or download:
inf.ethz.ch/pub/publica...th12187.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dinis.inf.ethz.ch/publi...diss.de (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. A survey of entropy measures and their applications in cryptography is presented. A new information measure, smooth entropy, is introduced to quantify the number of almost uniform random bits that... (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):
71.6%:   Entropy Measures and Unconditional Security in Cryptography - Cachin (1997)   (Correct)
9.4%:   Unconditional Security Against Memory-Bounded Adversaries - Cachin, Maurer (1997)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Smoothing Probability Distributions and Smooth Entropy.. - Cachin, al. (1996)   (Correct)
0.1:   Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997)   (Correct)
0.1:   Smooth Entropy and Rényi Entropy - Cachin (1997)   (Correct)

Similar documents based on text:   More   All
0.3:   A Network Architecture Based On Market Principles - Fankhauser (2000)   (Correct)
0.2:   Efficiency and Security of Cryptosystems based on Number Theory - Bleichenbacher (1996)   (Correct)
0.2:   Adaptive End-to-End Quality of Service Guarantees in IP Networks - Pletka (2004)   (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/article/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/article/cachin97entropy.html" }
Citations (may not include all citations):
493   Communications of the ACM (context) - Valiant, of et al. - 1984
239   Cryptography: Theory and practice (context) - Stinson - 1995
191   New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
84   Simulating BPP using a general weak random source - Zuckerman - 1991
60   Computing with very weak random sources - Srinivasan, Zuckerman - 1994
52   The wire-tap channel (context) - Wyner - 1975
38   On some methods for unconditionally secure key distribution .. - Stinson - 1996
35   On extracting randomness from weak random sources (context) - Ta-Shma - 1996
8   Generating random bits from an arbitrary source: Fundamental.. (context) - Vembu, Verd'u - 1995
2   Alfr'ed R'enyi: Selected papers (context) - Turan - 1976
2   th Annual ACM Symposium on Theory of Computing (context) - Zuckerman, sampling et al. - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://dinis.inf.ethz.ch/publications/diss.de.html):   More
Efficiency and Security of Cryptosystems Based on Number Theory - Bleichenbacher (1996)   (Correct)
Extending a Library for Geometric Computation to Provide.. - De Lorenzi (1995)   (Correct)
Design of Neural Networks Using a Priori Knowledge - Cozzio-Büeler (1995)   (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