Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann  Home/Search
Context Related
| informatik.unihil...PP_96MultiBC.ps.gz semper.org/sirene/...PP_96MultiBC.ps.gz semper.org//sirene...PP_96MultiBC.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: informatik.unihilde...sirene.lit (more) From: semper.org//sirene//...sirene.lit (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present and compare definitions of the notion of "statistically hiding" protocols, and we propose a novel statistically hiding commitment scheme. Informally, a protocol statistically hides a secret if a computationally unlimited adversary who conducts the protocol with the owner of the secret learns almost nothing about it. One definition is based on the L 1 -norm distance between probability distributions, the other on information theory. We prove that the two definitions are essentially... (Update)
Context of citations to this paper: More
.... follow the information theoretic definitions of unconditional security for oblivious transfer and other multiparty protocols [BCS96, BC97, DPP96], but formal treatment lies not in the scope of this paper. Informally, an OT protocol is correct if it accomplishes the...
.... However if one wants provable security without losing in efficiency one can use the efficient provably secure commitment scheme of [DPP96] based on collision resistant hashing. 2.2 Previous approaches Almost all the VSS protocols in the literature (with the curious exception of...
Cited by: More
Simplified VSS and Fast-track Multiparty Computations with .. - Gennaro, Rabin, Rabin (1998) (Correct)
On the Foundations of Oblivious Transfer - Cachin (1998) (Correct)
Active bibliography (related documents): More All
0.7: Sequential Iteration of Interactive Arguments and an.. - Damgård, Pfitzmann (1997) (Correct)
0.5: An Efficient Off-line Electronic Cash System Based On The.. - Brands (1993) (Correct)
0.3: The Foundations of Modern Cryptography - Goldreich (1998) (Correct)
Similar documents based on text: More All
1.6: Improved Non-Committing Encryption Schemes based on a.. - Damgård, Nielsen (2000) (Correct)
1.5: On the (Im)possibility of Basing Oblivious Transfer.. - Damgård.. (1998) (Correct)
1.3: R^n- and G^n-Logics - Hintermeier, Kirchner, Mosses (1996) (Correct)
BibTeX entry: (Update)
Ivan B. Damgard, Torben P. Pedersen, and Birgit Pfitzmann, Statistical secrecy and multi-bit commitments, BRICS Report, RS-96-45, 1996. http://citeseer.ist.psu.edu/damgard96statistical.html More
@misc{ damgard96statistical,
author = "I. Damgard and T. Pedersen and B. Pfitzmann",
title = "Statistical secrecy and multi-bit commitments",
text = "Ivan B. Damgard, Torben P. Pedersen, and Birgit Pfitzmann, Statistical
secrecy and multi-bit commitments, BRICS Report, RS-96-45, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/damgard96statistical.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
196 Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al. - 1988
159 Non-interactive and information-theoretic secure verifiable .. (context) - Pedersen - 1992
142 Federal Information Processing Standards Publication FIPS PU.. (context) - Standard - 1995
111 Information Theory: Coding Theorems for Discrete Memoryless .. (context) - Csisz'ar, Korner - 1981
100 New York: Wiley (context) - Gallager, Theory et al. - 1968
61 A design principle for hash functions (context) - Damgard - 1990
56 Collision free hash functions and public key signature schem.. (context) - Damgard - 1988
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damgard et al. - 1988
41 Nontransitive transfer of confidence: a perfect zero-knowled.. - Brassard, Cr'epeau - 1986
41 Cryptographically strong undeniable signatures, unconditiona.. - Chaum, Heijst et al. - 1992
32 the cunning power of cheating verifiers: some observations a.. (context) - Oren - 1987
27 RIPEMD-160: A strengthened version of RIPEMD (context) - Dobbertin, Bosselaers et al. - 1996
21 A discrete logarithm implementation of perfect zero-knowledg.. (context) - Boyar, Kurtz et al. - 1990
17 Minimum resource zeroknowledge proofs - Kilian, Micali et al. - 1989
8 A remark on a signature scheme where forgery can be proved (context) - Bleumer, Pfitzmann et al. - 1991
8 Zeroknowledge arguments for NP can be based on general compl.. (context) - Naor, Ostrovsky et al. - 1993
5 Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge P.. - Cramer, Damgard
4 Random self-reducibility and zero knowledge proofs of posses.. (context) - Tompa, Woll - 1987
2 Efficient Interactive Arguments (context) - Kilian - 1995
2 A voting scheme (context) - Bos, Chaum et al.
1 A Note on Efficient Proofs and Arguments (context) - Kilian - 1992
1 Bit commitment using randomness (context) - Naor - 1991
Documents on the same site (http://www.informatik.uni-hildesheim.de/~sirene/lit/sirene.lit.html): More
Technical Aspects of Data Protection in Health Care Informatics - Pfitzmann, Pfitzmann (1992) (Correct)
How To Break The Direct RSA-Implementation Of Mixes - Pfitzmann, Pfitzmann (1990) (Correct)
MIXes in Mobile Communication Systems: Location.. - Federrath, Jerichow, .. (1996) (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