Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar26. CRYPTO 2006: Santa Barbara, California, USA
Cynthia Dwork:
Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings. Lecture Notes in Computer Science 4117, Springer 2006, ISBN 3-540-37432-9- Marc Fischlin:
Round-Optimal Composable Blind Signatures in the Common Reference String Model. 60-77 - Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen:
Rankin's Constant and Blockwise Lattice Reduction. 112-130 - Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan:
A Method for Making Password-Based Key Exchange Resilient to Server Compromise. 142-159 - Ran Canetti, Shai Halevi, Michael Steiner:
Mitigating Dictionary Attacks on Password-Protected Local Storage. 160-179 - Anna Lysyanskaya, Nikos Triandopoulos:
Rationality and Adversarial Behavior in Multi-party Computation. 180-197 - Moni Naor, Gil Segev, Adam D. Smith:
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. 214-231 - Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam D. Smith:
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. 232-250 - Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. 271-289 - Xavier Boyen, Brent Waters:
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). 290-307 - Zulfikar Ramzan, David P. Woodruff:
Fast Algorithms for the Free Riders Problem in Broadcast Encryption. 308-325 - Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren:
The Number Field Sieve in the Medium Prime Case. 326-344 - Saurabh Agarwal, Ronald Cramer, Robbert de Haan:
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. 394-408 - Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
Random Selection with an Adversarial Majority. 409-426 - Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Oblivious Transfer and Linear Functions. 427-444 - Martin Hirt, Jesper Buus Nielsen:
Robust Multiparty Computation with Linear Communication Complexity. 463-482 - Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. 483-500 - Hao Chen, Ronald Cramer:
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. 521-536 - Remo Meier, Bartosz Przydatek:
On Robust Combiners for Private Information Retrieval and Other Primitives. 555-569 - Dan Boneh, Xavier Boyen:
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions. 570-583
maintained by 
at 
at 
last updated on 2018-12-12 00:39 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint