default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. TCC 2013: Tokyo, Japan
- Amit Sahai:
Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings. Lecture Notes in Computer Science 7785, Springer 2013, ISBN 978-3-642-36593-5 - Yevgeniy Dodis, Yu Yu:
Overcoming Weak Expectations. 1-22 - Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia:
A Counterexample to the Chain Rule for Conditional HILL Entropy - And What Deniable Encryption Has to Do with It. 23-39 - Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. 40-59 - Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Concurrent Zero Knowledge in the Bounded Player Model. 60-79 - Ran Canetti, Huijia Lin, Omer Paneth:
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. 80-99 - Melissa Chase, Markulf Kohlweiss
, Anna Lysyanskaya, Sarah Meiklejohn:
Succinct Malleable NIZKs and an Application to Compact Shuffles. 100-119 - Craig Gentry:
Encrypted Messages from the Heights of Cryptomania. 120-121 - Xavier Boyen:
Attribute-Based Functional Encryption on Lattices. 122-142 - Zvika Brakerski:
When Homomorphism Becomes a Liability. 143-161 - Benny Applebaum:
Garbling XOR Gates "For Free" in the Standard Model. 162-181 - Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. 182-201 - Prabhanjan Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao:
On the (In)security of Fischlin's Paradigm. 202-221 - Charalampos Papamanthou, Elaine Shi, Roberto Tamassia:
Signatures of Correct Computation. 222-242 - Gilad Asharov, Yehuda Lindell, Tal Rabin:
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. 243-262 - R. Amzi Jeffs, Mike Rosulek:
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities. 263-280 - Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas:
Feasibility and Completeness of Cryptographic Tasks in the Quantum World. 281-296 - Mohammad Mahmoody, David Xiao:
Languages with Efficient Zero-Knowledge PCPs are in SZK. 297-314 - Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-interactive Arguments via Linear Interactive Proofs. 315-333 - Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. - Rafael Pass:
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. 334-354 - Tal Malkin:
Secure Computation for Big Data. 355 - Elette Boyle, Shafi Goldwasser, Stefano Tessaro:
Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. 356-376 - Steve Lu, Rafail Ostrovsky:
Distributed Oblivious RAM for Secure Two-Party Computation. 377-396 - Steven A. Myers, Mona Sergi, Abhi Shelat:
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead. 397-417 - Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova, Abhradeep Thakurta:
Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy. 418-436 - Iftach Haitner, Eran Omri, Hila Zarosim:
Limits on the Usefulness of Random Oracles. 437-456 - Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith:
Analyzing Graphs with Node Differential Privacy. 457-476 - Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Universally Composable Synchronous Computation. 477-498 - Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid:
Multi-Client Non-interactive Verifiable Computation. 499-518 - Yehuda Lindell, Hila Zarosim:
On the Feasibility of Extending Oblivious Transfer. 519-538 - Mohammad Hajiabadi, Bruce M. Kapron:
Computational Soundness of Coinductive Symbolic Security under Active Attacks. 539-558 - Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti:
Revisiting Lower and Upper Bounds for Selective Decommitments. 559-578 - Ron Rothblum:
On the Circular Security of Bit-Encryption. 579-598 - Benny Applebaum:
Cryptographic Hardness of Random Local Functions-Survey. 599 - Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky:
On the Power of Correlated Randomness in Secure Computation. 600-620 - Ivan Damgård, Sarah Zakarias:
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. 621-641 - Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges:
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens. 642-661 - Kfir Barhum, Thomas Holenstein:
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. 662-679 - Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis:
Algebraic (Trapdoor) One-Way Functions and Their Applications. 680-699 - Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang:
Randomness-Dependent Message Security. 700-720 - David Xiao:
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. 721-722
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-08 20:41 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:
