B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable Secret Sharing in the Presence of Faults. IEEE Symposium on Foundations of Computer Science, pages 335--344. IEEE, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Non-Malleable Cryptography - Dolev, Dwork, Naor (1991) (300 citations) (Correct)
....cryptosystem. Our cryptosystem does not assume a trusted center, nor does it assume that any given collection of users knows the identities of other users in the system. In contrast, all other research touching on this problem of which we are aware requires at least one of these assumptions (e.g. [6, 7, 27]) To further motivate non malleable public key cryptography, in Section 3.4 we discuss an extremely simple protocol for public key authentication, a relaxation of digital signatures that permits an authenticator A to authenticate messages m, but in which the authentication needn t be verifiable ....
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable Secret Sharing in the Presence of Faults, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 383-395.
Non-Malleable Cryptography - Dolev, Dwork, Naor (1998) (300 citations) (Correct)
....there are certain kinds of relations R that we cannot rule out. For example, if R(ff; fi) holds precisely when fi 2 E(ff) then from E(ff) it is trivial to compute fi, and hence E(fi) such that R(ff; fi) is satisfied. For formal definitions and specifications see Section 2. assumptions (e.g. [20, 21, 62]) Non Malleable String Commitment A second important scenario for non malleability is string commitment. Let A and B run a string commitment protocol. Assume that A is non faulty, and that A commits to the string ff. Assume that, concurrently, C and D are also running a commitment protocol in ....
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing in the Presence of Faults, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 383--395.
Efficient Byzantine-tolerant erasure-coded storage - Garth Goodson Jay (2003) (6 citations) (Correct)
No context found.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable Secret Sharing in the Presence of Faults. IEEE Symposium on Foundations of Computer Science, pages 335--344. IEEE, 1985.
Efficient Byzantine-tolerant erasure-coded storage - Garth Goodson Jay (2003) (6 citations) (Correct)
No context found.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable Secret Sharing in the Presence of Faults. IEEE Symposium on Foundations of Computer Science, pages 335--344. IEEE, 1985.
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