×

Advances in cryptology – CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17–21, 2008. Proceedings. (English) Zbl 1155.94010

Lecture Notes in Computer Science 5157. Berlin: Springer (ISBN 978-3-540-85173-8/pbk). xiv, 594 p. (2008).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1123.94001).
Indexed articles:
Coron, Jean-Sébastien; Patarin, Jacques; Seurin, Yannick, The random oracle model and the ideal cipher model are equivalent, 1-20 [Zbl 1183.94026]
Hofheinz, Dennis; Kiltz, Eike, Programmable hash functions and their applications, 21-38 [Zbl 1183.94052]
Goldwasser, Shafi; Kalai, Yael Tauman; Rothblum, Guy N., One-time programs, 39-56 [Zbl 1183.68285]
Pandey, Omkant; Pass, Rafael; Vaikuntanathan, Vinod, Adaptive one-way functions and applications, 57-74 [Zbl 1183.94044]
Jetchev, Dimitar; Venkatesan, Ramarathnam, Bits security of the elliptic curve Diffie-Hellman secret keys, 75-92 [Zbl 1183.94038]
Garg, Sanjam; Bhaskar, Raghav; Lokam, Satyanarayana V., Improved bounds on security reductions for discrete log based signatures, 93-107 [Zbl 1183.94051]
Boneh, Dan; Halevi, Shai; Hamburg, Mike; Ostrovsky, Rafail, Circular-secure encryption from decision Diffie-Hellman, 108-125 [Zbl 1183.94025]
Hemenway, Brett; Ostrovsky, Rafail, Public-key locally-decodable codes, 126-143 [Zbl 1183.94036]
Handschuh, Helena; Preneel, Bart, Key-recovery attacks on universal hash function based MAC algorithms, 144-161 [Zbl 1183.94035]
Mendel, Florian; Pramstaller, Norbert; Rechberger, Christian; Kontak, Marcin; Szmidt, Janusz, Cryptanalysis of the GOST hash function, 162-178 [Zbl 1183.94042]
De Cannière, Christophe; Rechberger, Christian, Preimages for reduced SHA-0 and SHA-1, 179-202 [Zbl 1183.94027]
Eisenbarth, Thomas; Kasper, Timo; Moradi, Amir; Paar, Christof; Salmasizadeh, Mahmoud; Shalmani, Mohammad T. Manzuri, On the power of power analysis in the real world: A complete break of the KeeLoq code hopping scheme, 203-220 [Zbl 1183.94032]
Biham, Eli; Carmeli, Yaniv; Shamir, Adi, Bug attacks, 221-240 [Zbl 1183.94022]
Damgård, Ivan; Ishai, Yuval; Krøigaard, Mikkel; Nielsen, Jesper Buus; Smith, Adam, Scalable multiparty computation with nearly optimal work and resilience, 241-261 [Zbl 1183.68082]
Prabhakaran, Manoj; Rosulek, Mike, Cryptographic complexity of multi-party computation problems: Classifications and separations, 262-279 [Zbl 1183.68086]
Faugère, Jean-Charles; Levy-dit-Vehel, Françoise; Perret, Ludovic, Cryptanalysis of MinRank, 280-296 [Zbl 1183.94033]
Maximov, Alexander; Khovratovich, Dmitry, New state recovery attack on RC4, 297-316 [Zbl 1183.94041]
Delerablée, Cécile; Pointcheval, David, Dynamic threshold public-key encryption, 317-334 [Zbl 1183.94028]
Boldyreva, Alexandra; Fehr, Serge; O’Neill, Adam, On notions of security for deterministic encryption, and efficient constructions without random oracles, 335-359 [Zbl 1183.94024]
Bellare, Mihir; Fischlin, Marc; O’Neill, Adam; Ristenpart, Thomas, Deterministic encryption: Definitional equivalences and constructions without random oracles, 360-378 [Zbl 1183.94020]
Ostrovsky, Rafail; Skeith, William E. III, Communication complexity in algebraic two-party protocols, 379-396 [Zbl 1183.94043]
Stam, Martijn, Beyond uniformity: Better security/efficiency tradeoffs for compression functions, 397-412 [Zbl 1183.68279]
Pietrzak, Krzysztof, Compression from collisions, or why CRHF combiners have a long output, 413-432 [Zbl 1183.68277]
Rogaway, Phillip; Steinberger, John, Constructing cryptographic hash functions from fixed-key blockciphers, 433-450 [Zbl 1183.94047]
Beimel, Amos; Nissim, Kobbi; Omri, Eran, Distributed private data analysis: Simultaneously solving how and what, 451-468 [Zbl 1183.68080]
Dwork, Cynthia; Yekhanin, Sergey, New efficient attacks on statistical disclosure control mechanisms, 469-480 [Zbl 1183.68243]
Mohassel, Payman; Weinreb, Enav, Efficient secure linear algebra in the presence of covert or computationally unbounded adversaries, 481-496 [Zbl 1183.68085]
Alwen, Joël; Shelat, Abhi; Visconti, Ivan, Collusion-free protocols in the mediated model, 497-514 [Zbl 1183.68079]
Dodis, Yevgeniy; Shoup, Victor; Walfish, Shabsi, Efficient constructions of composable commitments and zero-knowledge proofs, 515-535 [Zbl 1183.94030]
Peikert, Chris; Vaikuntanathan, Vinod, Noninteractive statistical zero-knowledge proofs for lattice problems, 536-553 [Zbl 1183.94045]
Peikert, Chris; Vaikuntanathan, Vinod; Waters, Brent, A framework for efficient and composable oblivious transfer, 554-571 [Zbl 1183.94046]
Ishai, Yuval; Prabhakaran, Manoj; Sahai, Amit, Founding cryptography on oblivious transfer – efficiently, 572-591 [Zbl 1183.94037]

MSC:

94-06 Proceedings, conferences, collections, etc. pertaining to information and communication theory
94A60 Cryptography
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1123.94001
PDF BibTeX XML Cite
Full Text: DOI