National Library of Energy BETA

Sample records for goldwasser stanka jovanovic

  1. Adaptively Secure Coin-Flipping, Revisited Shafi Goldwasser1

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    in this setting. We then shed light on the connection between adaptive and strongly adaptive adversariesAdaptively Secure Coin-Flipping, Revisited Shafi Goldwasser1 , Yael Tauman Kalai2 , and Sunoo Park3' bits, can tolerate t(n) = O( n) even in the presence of adaptive corruptions, and they conjectured

  2. A Survey of Buffer Management Policies for Packet Switches1 Michael H. Goldwasser2

    E-Print Network [OSTI]

    Goldwasser, Michael

    A Survey of Buffer Management Policies for Packet Switches1 Michael H. Goldwasser2 Abstract Over of packet transmission for network switches. In a typical model, a switch receives packets on one or more the buffering of packets within a switch, and variations in packet properties used to differentiate quality

  3. Bidder Discounts and Target Premia in Takeovers Boyan Jovanovic; Serguey Braguinsky

    E-Print Network [OSTI]

    Braguinsky, Serguey

    entry cost is unknown; the entrant can come in as a third firm, or it can acquire one of the incumbents, in which case it does not pay * Jovanovic: Department of Economics, New York Uni- versity, 269 Mercer Street, New York, NY 10003 (e-mail: bj2@nyu.edu; http://home.uchicago.edu/~bjovanov/). Braguinsky

  4. On New Characterizations of Social Influence in Social Networks Makan Fardad, Fu Lin, Xi Zhang, and Mihailo R. Jovanovic

    E-Print Network [OSTI]

    Jovanovic, Mihailo

    with maximal social impact. We then consider a framework for optimally creating new social links subjectOn New Characterizations of Social Influence in Social Networks Makan Fardad, Fu Lin, Xi Zhang, and Mihailo R. Jovanovi´c Abstract-- We propose new characterizations of social influ- ence, which quantify

  5. Multi-Input Functional Encryption Shafi Goldwasser

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    is a general tool for computing on encrypting data which allows for mining aggregate information from several different data sources (rather than just a single source as in single input functional encryption). We show been addressed by a number of papers, with general formal definitions first appearing in [BSW11, O'N10

  6. On the (In)security of the Fiat-Shamir Paradigm Sha Goldwasser Yael Tauman y

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    -Shamir transformation yields insecure digital signature schemes for any \\hash" function used by the transformation, 2004 Abstract In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identi#12;cation schemes into digital signature schemes. The idea of the trans- formation was to replace

  7. Turbulent drag reduction by streamwise traveling waves Armin Zare, Binh K. Lieu, and Mihailo R. Jovanovic

    E-Print Network [OSTI]

    Jovanovic, Mihailo

    of Minnesota Initiative for Renewable Energy and the Environment under Early Career Award RC- 0014 simulations have provided motivation for the development of a model-based framework for designing traveling

  8. State covariances and the matrix completion problem Yongxin Chen, Mihailo R. Jovanovic, and Tryphon T. Georgiou

    E-Print Network [OSTI]

    Jovanovic, Mihailo

    by the University of Minnesota Initiative for Renewable Energy and the Environment under Early Career Award RC-0014, noise statistics. I. INTRODUCTION The motivation for this work stems from the need to explain statistics

  9. Linearization of a Pulse Width Modulated Power B.S., Electrical Engineering (2002)

    E-Print Network [OSTI]

    Perrott, Michael

    2002-01-01

    me what it truely means to be connected. Natalija Jovanovic was the Wendy to us Lost Boys. Karen Lee

  10. Sparse and Optimal Wide-Area Damping Control in Power Networks Florian Dorfler, Mihailo R. Jovanovic, Michael Chertkov, and Francesco Bullo

    E-Print Network [OSTI]

    Jovanovic, Mihailo

    of renewables in remote areas, and the increasing deregulation of energy markets, long-distance power transfers. Chertkov is with Theory Division & Center for Nonlinear Studies at LANL and with New Mexico Consortium, Los

  11. Essays in Technology Diffusion and Asset Pricing

    E-Print Network [OSTI]

    Bednarek, Ziemowit Konrad

    2010-01-01

    this study from real options literature. Jovanovic (2006)on investment in the real options framework, noting thatfuture. I depart from real options framework of investment

  12. Secure Multiparty Computation and Applications

    E-Print Network [OSTI]

    Goldreich, Oded

    to Oded Goldreich, my advisor. On top of being an expert on experts, and a dear friend, he is a devoted Bellare, Cynthia Dwork, Guy Even, Uri Feige, Shafi Goldwasser, Sandy Irani, Yoram Moses, Moni Naor, Tal

  13. A precise computational approach to knowledge

    E-Print Network [OSTI]

    Pass, Rafael (Rafael Nat Josef)

    2006-01-01

    The seminal work of Goldwasser, Micali and Rackoff put forward a computational approach to knowledge in interactive systems, providing the foundation of modern Cryptography. Their notion bounds the knowledge of a player ...

  14. THEORY OF COMPUTING, Volume 0 (2006), pp. 1--10 http://theoryofcomputing.org

    E-Print Network [OSTI]

    Fischer, Eldar

    2006-01-01

    , and Rubinfeld and Sudan [21] formally defined the general notion of property testing. Goldreich, Goldwasser property testing algorithms which are guaranteed to accept (with high confidence) not only inputs of the input size m. A 1­sided e­test for R is an e­test as above that in addition is guaranteed to accept any

  15. On Time and Order in Multiparty Computation Pablo Azar1

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    On Time and Order in Multiparty Computation Pablo Azar1 , Shafi Goldwasser2 , and Sunoo Park1 1 MIT of MPC does not deal with an important aspect: when do different players receive their output? In time-sensitive applications, the timing and order of output discovery may be another important deciding factor in whether

  16. Time-Lock Puzzles from Randomized Encodings Nir Bitansky

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    Time-Lock Puzzles from Randomized Encodings Nir Bitansky Shafi Goldwasser Abhishek Jain Omer Paneth§ Vinod Vaikuntanathan¶ Brent Waters May 27, 2015 Abstract Time-lock puzzles, introduced by May, Rivest a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed

  17. EUROPEAN ORGANIZATION FOR NUCLEAR RESEARCH CERN-PH-EP-2007-019

    E-Print Network [OSTI]

    , J.C. Hill5, D. Horv´ath28,c, P. Igo-Kemenes10, K. Ishii22, H. Jeremie17, P. Jovanovic1, T.R. Junk6,i.P. Ward5, D.R. Ward5, P.M. Watkins1, A.T. Watson1, N.K. Watson1, P.S. Wells7, T. Wengler7, N. Wermes3, G

  18. A measurement of the ?(b)^0 lifetime

    E-Print Network [OSTI]

    Wilson, Graham Wallace; OPAL Collaboration; Akers, R.; Alexander, G.; Allison, J.; Altekamp, N.; Ametewee, K.; Anderson, K.J.; Anderson, S.; Arcelli, S.; Asai, S.; Axen, D.; Azuelos, G.

    1995-06-29

    . Fiedler e, M. Fierro b, M. Fincke-Keeler ab, H.M. Fischer ‘, R. Folman ‘, D.G. Fong q, M. Foucher 4, H. Fukui ‘, A. Ftirtjes h, P. Gagnon f, A. Gaidot “, J.W. Gary d, J. Gascon r, N.I. Geddes t, C. Geich-Gimbel’, S.W. Gensler i, F.X. Gentit “, T. Geralis..., D.E. Hutchcroft e, l? Igo-Kemenes k, D.C. Imrie Y, A. Jawahery 9, P.W. Jeffreys t, H. Jeremie r, M. Jimack ‘, A. Joly r, M. Jones f, R.W.L. Jones h, P Jovanovic a, D. Karlen f, J. Kanzaki ‘, K. Kawagoe ‘, T. Kawamoto ‘, R.K. Keeler ab, R...

  19. An improved measurement of the B(S)^0 lifetime

    E-Print Network [OSTI]

    Wilson, Graham Wallace; OPAL Collaboration; Akers, R.; Alexander, G.; Allison, J.; Ametewee, K.; Anderson, K.J.; Arcelli, S.; Asai, S.; Axen, D.; Azuelos, G.; Ball, A.H.; Barberio, E.

    1995-05-11

    . Fincke-Keeler =, H.M. Fischer c, P. Fischer c, R. Folman Y, D.G. Fong P, M. Foucher P, H. Fukui w, A. Ftirtjes h, P. Gagnon f, A. Gaidot t, J.W. Gary d, J. Gascon 4, N.I. Geddes s, C. Geich-Gimbel c, S.W. Gensler i, F.X. Gentit t, T. Geralis ‘, G..., P.W. Jeffreys s, H. Jeremie 9, M. Jimack a, M. Jones f, R.W.L. Jones h, P. Jovanovic a, C. Jui d, D. Karlen f, J. Kanzaki w, K. Kawagoe w, T. Kawamoto w, R.K. Keeler =, R.G. Kellogg P, B.W. Kennedy ‘, B. King h, J. King m, J. Kirk ab, S. Kluthe, T...

  20. ?^(++) production in hadronic Z^0 decays

    E-Print Network [OSTI]

    Wilson, Graham Wallace; OPAL Collaboration; Alexander, G.; Allison, J.; Altekamp, N.; Ametewee, K.; Anderson, K.J.; Anderson, S.; Arcelli, S.; Asai, S.; Axen, D.; Azuelos, G.; Ball, A.H.

    1995-09-01

    Pozo h, H. Deng 9, M.S. Dixit s, E. do Couto e Silvae, E. Duchovni ‘, G. Duckeck h, I.P. Duerdoth P, U.C. Dunwoody h, J.E.G. Edwards P, P.G. Estabrooks f, H.G. Evans i, F. Fabbri b, B. Fabbro “, P. Fath k, F. Fiedler e, M. Fierro b, M. Fincke-Keeler...-Jones P, D.E. Hutchcroft e, P. Igo-Kemenes k,D.C. Imrie Y, A. Jawahery 9, P.W. Jeffreys t, H. Jeremie r, M. Jimack”, A. Joly ‘, M. Jones f, R.W.L. Jones h, U. Jost k, P. Jovanovic *, J. Kanzaki ‘, D. Karlen f, K. Kawagoe ‘, T. Kawamoto ‘, R.K. Keeler ab...

  1. Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU

    E-Print Network [OSTI]

    Bahi, Jacques M; Guyeux, Christophe; Héam, Pierre-Cyrille

    2011-01-01

    In this paper we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven to be chaotic according to the Devaney's formulation. We thus propose an efficient implementation for GPU that successfully passes the BigCrush tests, deemed to be the hardest battery of tests in TestU01. Experiments show that this PRNG can generate about 20 billion of random numbers per second on Tesla C1060 and NVidia GTX280 cards. It is then established that, under reasonable assumptions, the proposed PRNG can be cryptographically secure. A chaotic version of the Blum-Goldwasser asymmetric key encryption scheme is finally proposed.