E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In Carl Pomerance, editor, Advances in Cryptology - Crypto '87, pages 156--166, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science Volume 293.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....about six ordinary PK (#) y = g . Proofs of knowledge or equality in di#erent groups. The previous protocol can also be used to prove that the discrete logarithms of two group elements y 1 G 1 , y 2 G 1 to the bases g 1 G 1 and g 2 G 2 in di#erent groups G 1 and G 2 are equal [BCDvdG88, CM99b]. Let the order of the groups be q 1 and q 2 , respectively. This proof can be realized only if both discrete logarithms lie in the interval [0, min q 1 , q 2 ] The idea is that the prover commits to the discrete logarithm in some group, say G = the order of which he does not know, and ....

Ernest F. Brickell, David Chaum, Ivan B. Damgard, and Jeroen van de Graaf. Gradual and verifiable release of a secret. In Carl Pomerance, editor, Advances in Cryptology --- CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 156--166. Springer-Verlag, 1988.

....i.e. the information of originator s sending a message to the recipient and the information of the recipient s sending a receipt to the originator must be exchanged at the (almost) same time. One method to exchange information simultaneously is to use complicated cryptographic protocols[1][2][4] 5] 7] 10] but they seem to be impractical. The other method[12] is considered to utilize the reliable TTP (Trusted Third Party) This method is one of practical solutions, but the problem is high dependency on TTP in executing each step of the protocol compared to the previous method. In ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf, "Gradual and Verifiable Release of a Secret", In Advances in Cryptology: Proceedings of Crypto'87, LNCS 293, pp. 156-166, Springer-Verlag, 1988.

....systems [8] in which a payment is exchanged for an item of value, contract signing [4, 1] in which parties exchange commitments to a contractual text, certified electronic mail [2, 24, 9] and other purposes. There are several categories of fair exchange protocols. Gradual exchange protocols [4, 6] work by having the parties release their items in small installments, thus ensuring that at any given moment the amount of knowledge on both sides is approximately the same. The drawback of this approach is that a large number of communication steps is required. Gradual exchange is also ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In Proc. Advances in Cryptology -- Crypto '87, pages 156--166, 1987.

....systems [8] in which a payment is exchanged for an item of value, contract signing [4, 1] in which parties exchange commitments to a contractual text, certified electronic mail [2, 24, 9] and other purposes. There are several categories of fair exchange protocols. Gradual exchange protocols [4, 6] work by having the parties release their items in small installments, thus ensuring that at any given moment the amount of knowledge on both sides is approximately the same. The drawback of this approach is that a large number of communication steps is required. Gradual exchange is also ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In Proc. Advances in Cryptology -- Crypto '87, pages 156--166, 1987.

....i.e. the information of originator s sending a message to the recipient and the information of the recipient s sending a receipt to the originator must be exchanged at the (almost) same time. One method to exchange information simultaneously is to use complicated cryptographic protocols[1][2][4] 5] 7] 10] but they seem to be impractical. The other method[12] is considered to utilize the reliable TTP (Trusted Third Party) This method is one of practical solutions, but the problem is high dependency on TTP in executing each step of the protocol compared to the previous method. In ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf, "Gradual and Verifiable Release of a Secret", In Advances in Cryptology: Proceedings of Crypto'87, LNCS 293, pp. 156-166, Springer-Verlag, 1988.

....is exchanged for an item of value, contract signing [4, 1] in which parties exchange commitments to a contractual text, certified electronic mail [2, 24, 9] and other purposes. There are several categories of protocols designed to tackle the fair exchange problem. Gradual exchange protocols [4, 6] work by having the parties release their items in small installments, thus ensuring that at any given moment the amount of knowledge on both sides is approximately the same. The drawback of this approach is that a large number of communication steps between the parties is required. Gradual ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In Proc. Advances in Cryptology -- Crypto '87, pages 156--166, 1987.

.... to demonstrate atomic formulae of the form x a1 1 ff 2 x a2 2 Delta Delta Delta ff k x ak k = ff 1 mod q; but this requires P to perform O( P k i=1 a i ) separate basic proofs of knowledge and proofs of equality of discrete logarithms; Brickell, Chaum, Damgard and Van de Graaf [11] showed how to prove that an exponent is in an interval, but their protocol inherently requires binary challenges (and thus polynomially many iterations) and moreover the proof must be performed for a substantially larger interval in order to avoid leakage of information; and The protocol of ....

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In C. Pomerance, editor, Advances in Cryptology--CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 156--166. SpringerVerlag, 1988.

....X i to U (i = 1; t) 3. U calculates a; b as follows: a = g d mod p; b i = G d i mod N = X i : U executes the computational zero knowledge version of the compare commitment protocol (unshared modulus) between a and b i (i = 1; t) with interval I = N; 2N ] against trustees [3]. U also executes the VSS protocol (conditionally secure version [11] for a. 5 Scheme 3 for RSA and Rabin The following values are determined and published by the system. p; q: primes, qjp Gamma 1, Ord(g) Ord(h) q, BC g (x; r) g x h r mod p We suppose the RSA and Rabin schemes as ....

Brickell, E., Chaum, D., Damgard, I. and van de Graaf, Gradual and Verifiable Release of a Secret, Proc. of Crypto 87, LNCS, Springer-Verlag (1988).

No context found.

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In C. Pomerance, editor, Advances in Cryptology --- CRYPTO '87, volume 293 of LNCS, pages 156--166. Springer-Verlag, 1988.

No context found.

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In Carl Pomerance, editor, Advances in Cryptology - Crypto '87, pages 156--166, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science Volume 293.

No context found.

E. F. Brickell, D. Chaum, I. B. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret. In C. Pomerance, editor, Advances in Cryptology --- CRYPTO '87, volume 293 of LNCS, pages 156--166. Springer-Verlag, 1988. 16

No context found.

Brickell, E. F., Chaum, D., Damgard, I. B., and van de Graaf, J. (1987) Gradual and verifiable release of a secret. Advances in Cryptology -- CRYPTO '87 , Santa Barbara, CA, Aug., vol. 293 of Lecture Notes in Computer Science, pp. 156--166, Springer-Verlag, Berlin.

No context found.

Brickell, E. F., Chaum, D., Damgard, I. B. and van de Graaf, J. (1987) Gradual and verifiable release of a secret. In Advances in Cryptology---CRYPTO '87, Santa Barbara, CA, August. Berlin.

No context found.

E. Brickell, D. Chaum, I. Damgard, and Van de Graaf. Gradual and verifiable release of a secret. In Proceedings of CRYPTO'87, pages 156--166, 1987.

No context found.

E. Brickell, D. Chaum, I. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret (extended abstract). In Advances in Cryptology---CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 156--166. Springer-Verlag, 1988, 16--20 August 1987.

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