IACR Local SearchPossible queries include
Found 30000 results
We give a simple and efficient construction of a verifiable random function (VRF) on bilinear groups. Our construction is direct. In contrast to prior VRF constructions [MRV99, Lys02], it avoids using an inefficient...last revised 7 Mar 2005
We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n-1)/2 of n dishonest servers in the semi-honest environment....received 14 Jan 2006
Main place Conference Program Call for papers Social Program Conference Venue Registration Accommodation Contact Conference Program The scientific program and included breaks will be held at the Congress House. A welcome drink...
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project Public-Key Cryptography 2005 Les Diablerets, Switzerland Serge Vaudenay (Ed.): Public Key Cryptography - PKC 2005, 8th...
TCC 2006 March 4-7 2006, Columbia University New York, NY USA Home Call for papers Accepted papers Program Rump session Venue Entertainment Restaurant list Travel Info Accommodation Registration Contact Final Program All talks...
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project TCC 2006: New York, NY, USA Shai Halevi and Tal Rabin (Eds.): Theory of Cryptography, Third Theory of Cryptography Conference,...
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed correctly evaluated on the...
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed correctly evaluated on the...received 16 Jan 2019
TCC 2009 Accepted Papers On the (Im)Possibility of Key Dependent Encryption Iftach Haitner; Thomas Holenstein Hierarchical Identity Based Encryption with Polynomially Many Levels Craig Gentry; Shai Halevi Universally...
Pseudorandom Functions (PRFs), introduced by Goldreich, Goldwasser and Micali, allow one to efficiently simulate the computation of a function which is indistinguishable from a truly random function. A seemingly stronger...received 27 Feb 2006
CRYPTO 2009: Shai Halevi (Eds.): Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009 Proceedings. CRYPTO 2009 Santa Barbara, CA, USA, August 16-20,...
List of Accepted Papers - Sessionwise Algebra and Number Theory Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log Pascal Paillier, Damien Vergnaud Do All Elliptic Curves of the Same Order Have the Same...
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project PKC 2003: PKC 2003: Miami, Florida, USA Yvo Desmedt (Ed.): Public Key Cryptography - PKC 2003, 6th International Workshop on...
Home Call for Papers Accepted Papers Program Proceedings Rump Session Venue Excursion Accommodation Travel Info Registration Sponsors Contact List of Accepted Papers On Generating the Initial Key in the Bounded Storage Model...
Author Index, TCC 2006 Beerliova, Zuzana 306 Beimel, Amos 486 Bender, Adam 60 Canetti, Ran 381 Catalano, Dario 120 Damgård, Ivan 41 , 286 Datta, Anupam 361 Derek, Ante 361 Di Crescenzo, Giovanni 226 Dodis, Yevgeniy 120 , 184 ,...
Sixth IACR Theory of Cryptography Conference TCC 2009 March 15-17, 2009, Golden Gateway Hotel (Holiday Inn) San Francisco, CA, USA Program Saturday, March 14 18:00-21:00 Registration 19:00-21:00 Welcome reception, Crystal room...
Eurocrypt 2004 - Accepted papers See the Eurocrypt 2004 web site for more information. On Generating the Initial Key in the Bounded Storage Model Stefan Dziembowski and Ueli Maurer Finding Small Roots of Bivariate Integer...