| M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, November 1996. |
No context found.
M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, November 1996.
No context found.
M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, April 1996.
....escrow will preserve the property of ordinary key escrow in speedy recovery of a small numberofkeys by resourceful agencies. Shamir s partial key escrow scheme was proposed for partial escrowing of a DES key. Partial key escrow has also been investigated by Micali [19] and Bellare and Goldwasser [1, 2] with emphasis on public key cryptosystems. These authors introduced and addressed an important issue: verifiability. The verifiability in partial key escrow goes beyond Micali s earlier idea of fair public key cryptosystems [18] and extends from merely fair sharing of secret to a guaranteed ....
....manner. In other words, rendering a part of a prime factor missing will not result in a sound time complexity problem upon which to base a partial key escrow scheme. The only known previous work on partial key escrowforinteger factoring based cryptosystems is due to Bellare and Goldwasser [2]. Their approach is called encapsulated key escrow (EKE) and uses a primitive called an EKE time capsule. An EKE time capsule encrypts a secret in a timed release manner, which means that its decryption procedure has a specified time complexity. In their EKE scheme for RSA, a key owner, who has ....
[Article contains additional citation context not shown here]
M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, November 1996. Presented at rump session of EUROCRYPT 96, May 1996. Available at http://www-cse.ucsd.edu/users/mihir/papers/escrow.html.
....theorem is particularly suited to this type of application, since it automatically provides a way to get small depth circuits for combinations of simple functions. We note that the theorem of [BS] and in consequence ours, are non constructive. The results of this paper appeared previously in [Be1] and [Be2] 2 Preliminaries Boolean for us means Sigma1 valued. A function f : f Gamma1; 1g n R is boolean if its range is f Gamma1; 1g. The sign of x 2 R, denoted sign (x) is Gamma1 if x 0, undefined if x = 0, and 1 if x 0. The sign of f f Gamma1; 1g n R, denoted sign (f) is ....
....(used for learning DNF under the uniform distribution) to the case of mutually independent distributions. Our techniques and results can be similarly extended to the case of mutually independent distributions. We discuss these extensions briefly here. For more details the reader is referred to [Be1]. A probability distribution q : f Gamma1; 1g n [0; 1] is mutually independent if the random variables x 1 ; x n are independent. Given a mutually independent distribution q one can define, with respect to q, an inner product, an orthonormal basis, and finally a Fourier series for ....
[Article contains additional citation context not shown here]
M. Bellare. The Spectral Norm of Finite Functions. MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-495 , February 1991.
No context found.
M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, April 1996.
No context found.
M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laboratory for Computer Science Technical Report 688, April 1996.
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