default search action
4. TCC 2007: Amsterdam, The Netherlands
- Salil P. Vadhan:
Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings. Lecture Notes in Computer Science 4392, Springer 2007, ISBN 3-540-70935-5
Encryption I
- Carl Bosley, Yevgeniy Dodis:
Does Privacy Require True Randomness? 1-20 - Saurabh Panjwani:
Tackling Adaptive Corruptions in Multicast Encryption Protocols. 21-40
Universally Composable Security
- Jörn Müller-Quade, Dominique Unruh:
Long-Term Security and Universal Composability. 41-60 - Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
Universally Composable Security with Global Setup. 61-85
Arguments and Zero Knowledge
- Krzysztof Pietrzak, Douglas Wikström:
Parallel Repetition of Computationally Sound Protocols Revisited. 86-102 - Hoeteck Wee:
Lower Bounds for Non-interactive Zero-Knowledge. 103-117 - Masayuki Abe, Serge Fehr:
Perfect NIZK with Adaptive Soundness. 118-136
Notions of Security
- Yonatan Aumann, Yehuda Lindell:
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. 137-156 - Michael Backes, Jörn Müller-Quade, Dominique Unruh:
On the Necessity of Rewinding in Secure Multiparty Computation. 157-173 - Oded Goldreich:
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. 174-193
Obfuscation
- Shafi Goldwasser, Guy N. Rothblum:
On Best-Possible Obfuscation. 194-213 - Dennis Hofheinz, John Malone-Lee, Martijn Stam:
Obfuscation for Cryptographic Purposes. 214-232 - Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-encryption. 233-252
Secret Sharing and Multiparty Computation
- Amos Beimel, Matthew K. Franklin:
Weakly-Private Secret Sharing Schemes. 253-272 - Jaume Martí-Farré, Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids. 273-290 - Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin:
Secure Linear Algebra Using Linearly Recurrent Sequences. 291-310 - Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri:
Towards Optimal and Efficient Perfectly Secure Message Transmission. 311-322
Signatures and Watermarking
- Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell:
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. 323-341 - Douglas Wikström:
Designated Confirmer Signatures Revisited. 342-361 - Nicholas Hopper, David Molnar, David A. Wagner:
From Weak to Strong Watermarking. 362-382
Private Approximation and Black-Box Reductions
- Amos Beimel, Renen Hallak, Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover. 383-403 - Remo Meier, Bartosz Przydatek, Jürg Wullschleger:
Robuster Combiners for Oblivious Transfer. 404-418 - Hoeteck Wee:
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. 419-433 - Yael Gertner, Tal Malkin, Steven A. Myers:
Towards a Separation of Semantic and CCA Security for Public Key Encryption. 434-455
Key Establishment
- Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner:
Unifying Classical and Quantum Key Distillation. 456-478 - David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish:
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. 479-498 - Michel Abdalla, Jens-Matthias Bohli, María Isabel González Vasco, Rainer Steinwandt:
(Password) Authenticated Key Establishment: From 2-Party to Group. 499-514
Encryption II
- Melissa Chase:
Multi-authority Attribute Based Encryption. 515-534 - Dan Boneh, Brent Waters:
Conjunctive, Subset, and Range Queries on Encrypted Data. 535-554 - Ben Adida, Douglas Wikström:
How to Shuffle in Public. 555-574 - Yuval Ishai, Anat Paskin:
Evaluating Branching Programs on Encrypted Data. 575-594
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.