نتایج جستجو برای: shafi
تعداد نتایج: 150 فیلتر نتایج به سال:
We show that for any constant d ∈ N, there exists a public-key encryption scheme that can securely encrypt any function f of its own secret-key, assuming f can be expressed as a polynomial of total degree-d. Such a scheme is said to be key-dependent message (KDM) secure w.r.t. degree-d polynomials. We also show that there exists a public-key encryption scheme that is KDM secure w.r.t. all Turin...
Distributed Control and Synchronization of Diffusively Coupled Systems by Sayed Yusef Shafi Doctor of Philosophy in Engineering – Electrical Engineering and Computer Sciences University of California, Berkeley Professor Murat Arcak, Chair Diffusively coupled networks, in which different components of a network adjust their behavior according to the local sum of differences between their own and...
“New Method Said to Solve Key Problem in Math” was the headline of a story in the New York Times on August 8, 2002, meaning the proof of the statement primes ∈ P, hitherto a big open problem in algorithmic number theory and theoretical computer science. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena of the Indian Institute of Technology accomplished the proof through a surprisingly elegant an...
Two distinct classes of realistic inflationary models consistent with present observations are reviewed. The first example relies on the Coleman-Weinberg potential and is readily realized within the framework of spontaneously broken global symmetries (for instance, global U(1)B−L). Depending on the parameters either new or large field inflation is possible. The second example exploits supersymm...
W. B. Tippens,1 S. Prakhov,1 C. E. Allgower,3,* V. Bekrenev,10 E. Berger,1 W. J. Briscoe,6 M. Clajus,1 J. R. Comfort,4 K. Craig,4 A. Efendiev,1 D. Grosnick,12 B. R. Holstein,9 G. M. Huber,11 D. Isenhower,2 N. Knecht,11 D. Koetke,12 A. Koulbardis,10 N. Kozlenko,10 S. Kruglov,10 G. J. Lolos,12 I. Lopatin,10 D. M. Manley,8 , A. Marušić,5 R. Manweiler,12 S. McDonald,1 B. M. K. Nefkens,1 J. Olmsted,...
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that indistinguishability obfuscation for all circuits implies: • The impossibility of average-case virtual black box obfuscation with auxiliary input fo...
We show that a new GUT scenario we proposed indicates that heterotic M-theory is one of the most interesting possibility to describe our world because of the two features in the scenario. The first feature is that E6 unified group plays an essential role not only in understanding larger mixing angles in lepton sector than in quark sector but also in solving the SUSY flavor problem by introducin...
A population of offspring from a cross between ‘Golden Smoothee’ × ‘Shafi Abadi’ apple which was developed by two methods of controlled pollination (with and without covering after controlled pollination) was used to investigate the inheritance of microsatellite alleles and the necessity of covering in controlled pollination of apple. DNA was extracted from 60 seedlings (30 from each method) as...
background: wasp stings are quite commonly observed in bangladesh though they are under reported. however, rhabdomyolysis following multiple wasp stings is a rare entity. case report: a middle aged physician was stung by a swarm of wasps at multiple sites of the body. he felt severe pain at the sites of the stings and was primarily treated with intravenous hydrocortisone and chlorpheniramine. w...
In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, whose value can be specified at run time. Other than the result of the computation on this input, nothing else about the program is leaked. Hence, a one-time program is like a black box function that may be evaluated once and then...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید