Cryptography from sunspots: How to use an imperfect string
Speaker: Abhi Shelat , University of VirginiaContact:
Date: October 12 2007
Time: 10:30AM to 12:00PM
Location: Patil/Kiva 32-G449
Host: Prof Silvio Micali, MIT
Chuck Wright, 617-253-6025, email@example.comRelevant URL:
>> The Common Reference String (CRS) model enables otherwise-impossible cryptographic goals such as removing interaction from protocols and guaranteeing composable security. However, the CRS model requires the reference string to be sampled from a fixed and known distribution (e.g., the uniform distribution); security analyses of all current protocols fail when the actual distribution of the reference string differs from the specified one even by a small amount.
>> This fact rules out a large class of potential implementations of the CRS model such as measurements of physical phenomena (like sunspots), or alternatively using random sources that might be adversarially influenced.
>> We study the possibility of obtaining universally composable (UC) security in a relaxed variant of theCRS model in which the reference string it sampled from an *arbitrary, adversarially specified* distribution that is unknown to the protocol. On the positive side, we demonstrate that UC general secure computation is obtainable in this model as long as:
>> (a) this distribution has some minimal min-entropy,
>> (b) it is efficiently samplable,
>> (c) the sampling algorithm has not too long a description, and
>> (d) the sampling algorithm is known to the adversary (and simulator).
>> On the negative side, we show that if any one of these four conditions is removed then general UC secure computation becomes impossible.
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in October 2007