default search action
9. TCC 2012: Taormina, Sicily, Italy
- Ronald Cramer:
Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7194, Springer 2012, ISBN 978-3-642-28913-2
Secure Computation
- Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohenberger, Abhi Shelat, Brent Waters:
Computing on Authenticated Data. 1-20 - Yuval Ishai, Rafail Ostrovsky, Hakan Seyalioglu:
Identifying Cheaters without an Honest Majority. 21-38 - Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou
:
On the Security of the "Free-XOR" Technique. 39-53 - Ivan Damgård, Sebastian Faust, Carmit Hazay
Secure Two-Party Computation with Low Communication. 54-74
(Blind) Signatures and Threshold Encryption
- Benoît Libert, Moti Yung:
Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions. 75-93 - Olivier Blazy
Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions. 94-111 - Yevgeniy Dodis, Iftach Haitner, Aris Tentes:
On the Instantiability of Hash-and-Sign RSA Signatures. 112-132 - Jae Hong Seo, Jung Hee Cheon:
Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures. 133-150
Zero-Knowledge and Security Models
- Yuval Ishai, Mohammad Mahmoody
On Efficient Zero-Knowledge PCPs. 151-168 - Helger Lipmaa
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. 169-189 - Nir Bitansky, Omer Paneth:
Point Obfuscation and 3-Round Zero-Knowledge. 190-208 - Ueli Maurer, Andreas Rüedlinger, Björn Tackmann:
Confidentiality and Integrity: A Constructive Perspective. 209-229
Leakage-Resilience
- Stefan Dziembowski, Sebastian Faust:
Leakage-Resilient Circuits without Computational Assumptions. 230-247 - Zvika Brakerski, Yael Tauman Kalai:
A Parallel Repetition Theorem for Leakage Resilience. 248-265 - Nir Bitansky, Ran Canetti, Shai Halevi:
Leakage-Tolerant Interactive Protocols. 266-284
Hash Functions
- Avradip Mandal, Jacques Patarin, Yannick Seurin:
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. 285-302 - Dimitar Jetchev, Onur Özen, Martijn Stam:
Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry. 303-320
Differential Privacy
- Anindya De:
Lower Bounds in Differential Privacy. 321-338 - Anupam Gupta, Aaron Roth
Iterative Constructions and Private Data Release. 339-356
Pseudorandomness I
- Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. 357-368 - Abhishek Jain, Krzysztof Pietrzak, Aris Tentes:
Hardness Preserving Constructions of Pseudorandom Functions. 369-382 - Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin:
Computational Extractors and Pseudorandomness. 383-403
Dedicated Encryption I
- Nishanth Chandran, Melissa Chase, Vinod Vaikuntanathan:
Functional Re-encryption and Collusion-Resistant Obfuscation. 404-421 - Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan:
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption. 422-439 - Vipul Goyal, Virendra Kumar
On Black-Box Reductions between Predicate Encryption Schemes. 440-457
Security Amplification
- Krzysztof Pietrzak, Alon Rosen, Gil Segev:
Lossy Functions Do Not Amplify Well. 458-475 - Yevgeniy Dodis, Abhishek Jain, Tal Moran, Daniel Wichs:
Counterexamples to Hardness Amplification beyond Negligible. 476-493
Resettable and Parallel Zero Knowledge
- Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia:
Resettable Statistical Zero Knowledge. 494-511 - Kai-Min Chung, Rafael Pass
The Knowledge Tightness of Parallel Zero-Knowledge. 512-529 - Chongwon Cho, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti:
Simultaneously Resettable Arguments of Knowledge. 530-547
Dedicated Encryption II
- Krzysztof Pietrzak:
Subspace LWE. 548-563 - Shafi Goldwasser, Allison B. Lewko, David A. Wilson:
Bounded-Collusion IBE from Key Homomorphism. 564-581 - Benjamin Fuller
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. 582-599
Pseudorandomness II
- Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. 600-617 - Yevgeniy Dodis, Thomas Ristenpart
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. 618-635 - Dario Fiore, Dominique Schröder
Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations. 636-653
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.
last updated on 2024-11-28 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: