Bos, J. and Purdy, G., "A voting scheme", Rump session of Crypto '88 (does not appear in the proceedings). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Efficient Off-line Electronic Cash System Based On The.. - Brands (1993) (50 citations) (Correct)
....is made to [8] anywhere. Corollary 8 can be found in [13] together with a sketch of (a different) proof. To the best of our knowledge, the representation problem for groups of prime order has furthermore been used as a tool in a handful of articles. For commitment purposes, it was used in [33] [2] and in the confirmation protocol of undeniable signatures ( 9, 10] all with k = 2. Furthermore, it has been put to use for signatures unconditionally secure for the signer in [13] and [24] fail stop signatures, k = 2) and for an identification scheme unconditionally secure for the prover in ....
Bos, J. and Purdy, G., "A voting scheme", Rump session of Crypto '88 (does not appear in the proceedings).
Statistical Secrecy and Multi-Bit Commitments - Damgård, Pedersen, Pfitzmann (1996) (2 citations) (Correct)
....change the bit committed to relies on specific number theoretic assumptions. More general assumptions are used in [24] which can be based on any collision intractable hash function, and [23] based on any one way permutation. Unconditionally hiding multi bit commitment schemes were presented in [3, 26, 9, 2]. They all rely on specific number theoretic assumptions, the hardness of computing discrete logarithms or factoring integers. In contrast, our scheme is based on any collision intractable hash function. This is an improvement in theory, because the assumption is weaker, and useful in practice, ....
J. Bos, D. Chaum, and G. Purdy, "A voting scheme," unpublished manuscript, presented at the rump session of CRYPTO '88.
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