TCC 2007 |
|
|---|---|
[Sort by page number] [Sort by citations count] | |
  | Salil P. Vadhan, editor, Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings. Springer, 2007. ISBN 3-540-70935-5. [Papers] Find this book on amazon.com  , amazon.co.uk , amazon.ca , amazon.de , amazon.fr , Google Books or Wikipedia. |
| Carl Bosley, Yevgeniy Dodis, Does Privacy Require True Randomness?, pp. 1 - 20, TCC 2007. [  Electronic
Edition][ Cited
7 times
] | |
| Saurabh Panjwani, Tackling Adaptive Corruptions in Multicast Encryption Protocols, pp. 21 - 40, TCC 2007. [ Electronic
Edition][Cited
5 times
] | |
| Jörn Müller-Quade, Dominique Unruh, Long-Term Security and Universal Composability, pp. 41 - 60, TCC 2007. [ Electronic
Edition][Cited
12 times
] | |
| Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish, Universally Composable Security with Global Setup, pp. 61 - 85, TCC 2007. [ Electronic
Edition][Cited
40 times
] | |
| Krzysztof Pietrzak, Douglas Wikström, Parallel Repetition of Computationally Sound Protocols Revisited, pp. 86 - 102, TCC 2007. [ Electronic
Edition][Cited
18 times
] | |
| Hoeteck Wee, Lower Bounds for Non-interactive Zero-Knowledge, pp. 103 - 117, TCC 2007. [ Electronic
Edition][Cited
1 times
] | |
| Masayuki Abe, Serge Fehr, Perfect NIZK with Adaptive Soundness, pp. 118 - 136, TCC 2007. [ Electronic
Edition][Cited
22 times
] | |
| Yonatan Aumann, Yehuda Lindell, Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries, pp. 137 - 156, TCC 2007. [ Electronic
Edition][Cited
47 times
] | |
| Michael Backes, Jörn Müller-Quade, Dominique Unruh, On the Necessity of Rewinding in Secure Multiparty Computation, pp. 157 - 173, TCC 2007. [ Electronic
Edition][Cited
4 times
] | |
| Oded Goldreich, On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits, pp. 174 - 193, TCC 2007. [ Electronic
Edition][Cited
6 times
] | |
| Shafi Goldwasser, Guy N. Rothblum, On Best-Possible Obfuscation, pp. 194 - 213, TCC 2007. [ Electronic
Edition][Cited
33 times
] | |
| Dennis Hofheinz, John Malone-Lee, Martijn Stam, Obfuscation for Cryptographic Purposes, pp. 214 - 232, TCC 2007. [ Electronic
Edition][Cited
28 times
] | |
| Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan, Securely Obfuscating Re-encryption, pp. 233 - 252, TCC 2007. [ Electronic
Edition][Cited
54 times
 ] | |
| Amos Beimel, Matthew K. Franklin, Weakly-Private Secret Sharing Schemes, pp. 253 - 272, TCC 2007. [ Electronic
Edition][Cited
5 times
] | |
| Jaume MartÃ-Farré, Carles Padró, On Secret Sharing Schemes, Matroids and Polymatroids, pp. 273 - 290, TCC 2007. [ Electronic
Edition][Cited
29 times
] | |
| Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin, Secure Linear Algebra Using Linearly Recurrent Sequences, pp. 291 - 310, TCC 2007. [ Electronic
Edition][Cited
12 times
] | |
| Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, S. Harsha Vardhan, Towards Optimal and Efficient Perfectly Secure Message Transmission, pp. 311 - 322, TCC 2007. [ Electronic
Edition][Cited
27 times
] | |
| Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell, Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions, pp. 323 - 341, TCC 2007. [ Electronic
Edition][Cited
22 times
] | |
| Douglas Wikström, Designated Confirmer Signatures Revisited, pp. 342 - 361, TCC 2007. [ Electronic
Edition][Cited
7 times
] | |
| Nicholas J. Hopper, David Molnar, David Wagner, From Weak to Strong Watermarking, pp. 362 - 382, TCC 2007. [ Electronic
Edition][Cited
8 times
] | |
| Amos Beimel, Renen Hallak, Kobbi Nissim, Private Approximation of Clustering and Vertex Cover, pp. 383 - 403, TCC 2007. [ Electronic
Edition][Cited
8 times
] | |
| Remo Meier, Bartosz Przydatek, Jürg Wullschleger, Robuster Combiners for Oblivious Transfer, pp. 404 - 418, TCC 2007. [ Electronic
Edition][Cited
20 times
] | |
| Hoeteck Wee, One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments, pp. 419 - 433, TCC 2007. [ Electronic
Edition][Cited
15 times
] | |
| Yael Gertner, Tal Malkin, Steven Myers, Towards a Separation of Semantic and CCA Security for Public Key Encryption, pp. 434 - 455, TCC 2007. [ Electronic
Edition][Cited
25 times
] | |
| Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner, Unifying Classical and Quantum Key Distillation, pp. 456 - 478, TCC 2007. [ Electronic
Edition][Cited
9 times
] | |
| David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish, Intrusion-Resilient Key Exchange in the Bounded Retrieval Model, pp. 479 - 498, TCC 2007. [ Electronic
Edition][Cited
21 times
] | |
| Michel Abdalla, Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, Rainer Steinwandt, (Password) Authenticated Key Establishment: From 2-Party to Group, pp. 499 - 514, TCC 2007. [ Electronic
Edition][Cited
16 times
] | |
| Melissa Chase, Multi-authority Attribute Based Encryption, pp. 515 - 534, TCC 2007. [ Electronic
Edition][Cited
79 times
] | |
| Dan Boneh, Brent Waters, Conjunctive, Subset, and Range Queries on Encrypted Data, pp. 535 - 554, TCC 2007. [ Electronic
Edition][Cited
129 times
] | |
| Ben Adida, Douglas Wikström, How to Shuffle in Public, pp. 555 - 574, TCC 2007. [ Electronic
Edition][Cited
26 times
] | |
| Yuval Ishai, Anat Paskin, Evaluating Branching Programs on Encrypted Data, pp. 575 - 594, TCC 2007. [ Electronic
Edition][Cited
28 times
] | |
|
3755 authors, 5428 conference papers from 177 conference proceedings, 559 journal papers from 8 journals | |
