4 citations found. Retrieving documents...
Silvio Micali and Gene Itkis. Private Communication.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Experimental Studies of Longitudinal Dynamics of Space-Charge.. - Wang   (Correct)

....which was later confirmed by a 2 D simulation of particle code [11] IV. RECTANGULAR BUNCH EXPERIMENT For rectangular beams, i.e. a uniform line charge density, the longitudinal space charge force is highly nonlinear, with little force at the flat region but very strong forces at the ends [12, 13]. In general, the 1 D cold fluid model can be employed to describe the longitudinal beam dynamics. The fluid equations can be written as L t v L z L v z =0 v t v v z e mg 3 E z = eg 4pe 0 mg 5 L z (3) where L is the line charge density and v is the particle ....

I. Haber, private communications.


How to Solve any Protocol Problem - An Efficiency Improvement .. - Goldreich, al. (1997)   (27 citations)  (Correct)

....utilizes Oblivious Transfer in order to present a maximumprivacy 2 party protocol for a specific Boolean function on three bits. Private computation of this specific function is all that is required for the multi party maximumprivacy protocol generator of [GMW2] in the version attributed to [HM]) 1. INTRODUCTION The main purpose of many cryptographic protocols is to allow parties to collaborate towards some common goal, while maintaining the maximum possible privacy of their secrets. Typically, the common goal is to compute some function of the local inputs (secrets) held by the ....

....Output: A s local output is a permutation 0 2 S 5 , and B s local output is a permutation oe 0 2 S 5 such that Delta oe = oe 0 Delta 0 . Here Delta means permutation composition. Recently, an efficiency improvement of the [GMW2] algorithm has been suggested by Haber and Micali [HM]. The protocols output by their algorithm use instances of a maximum privacy two party subprotocol for the following particular problem (in GF (2) arithmetic) Input: A s local input is a pair of bits a 1 and a 2 , while B s input consists of the bits b 1 and b 2 . Output: A s local output is a ....

[Article contains additional citation context not shown here]

Haber, S., and S. Micali, private communication, 1986.


Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin (2001)   (41 citations)  Self-citation (Itkis)   (Correct)

No context found.

Silvio Micali and Gene Itkis. Private Communication.


Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin (2001)   (41 citations)  Self-citation (Itkis)   (Correct)

.... scheme of [Kra00] as well as the key generation, signing and verifying in the Fiat Shamir based scheme of [BM99] and the scheme of [AR00] However, key generation and update are 1 Some improvements to tree based scheme of [BM99] not a ecting this discussion) have been proposed in [AR00] and [MI]. Forward Secure Signatures with Optimal Signing and Verifying 3 (presumably) performed much less frequently than signing and verifying, and can be performed o line as long in advance as necessary. Moreover, we show that, if we are willing to tolerate secret storage of 1 log 2 T values, we can ....

Silvio Micali and Gene Itkis. Private Communication.

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