Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings. (English) Zbl 1258.94005

Lecture Notes in Computer Science 7785. Berlin: Springer (ISBN 978-3-642-36593-5/pbk). xi, 724 p. (2013).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1238.94002].
Indexed articles:
Dodis, Yevgeniy; Yu, Yu, Overcoming weak expectations, 1-22 [Zbl 1296.94107]
Krenn, Stephan; Pietrzak, Krzysztof; Wadia, Akshay, A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it, 23-39 [Zbl 1297.94083]
Berman, Itay; Haitner, Iftach; Komargodski, Ilan; Naor, Moni, Hardness preserving reductions via cuckoo hashing, 40-59 [Zbl 1297.94049]
Goyal, Vipul; Jain, Abhishek; Ostrovsky, Rafail; Richelson, Silas; Visconti, Ivan, Concurrent zero knowledge in the bounded player model, 60-79 [Zbl 1297.94073]
Canetti, Ran; Lin, Huijia; Paneth, Omer, Public-coin concurrent zero-knowledge in the global hash model, 80-99 [Zbl 1296.94096]
Chase, Melissa; Kohlweiss, Markulf; Lysyanskaya, Anna; Meiklejohn, Sarah, Succinct malleable NIZKs and an application to compact shuffles, 100-119 [Zbl 1297.94058]
Gentry, Craig, Encrypted messages from the heights of cryptomania, 120-121 [Zbl 1297.94070]
Boyen, Xavier, Attribute-based functional encryption on lattices, 122-142 [Zbl 1310.94131]
Brakerski, Zvika, When homomorphism becomes a liability, 143-161 [Zbl 1310.94133]
Applebaum, Benny, Garbling XOR gates “for free” in the standard model, 162-181 [Zbl 1315.94048]
Bitansky, Nir; Dachman-Soled, Dana; Garg, Sanjam; Jain, Abhishek; Kalai, Yael Tauman; López-Alt, Adriana; Wichs, Daniel, Why “Fiat-Shamir for proofs” lacks a proof, 182-201 [Zbl 1315.94060]
Ananth, Prabhanjan; Bhaskar, Raghav; Goyal, Vipul; Rao, Vanishree, On the (in)security of Fischlin’s paradigm, 202-221 [Zbl 1296.94076]
Papamanthou, Charalampos; Shi, Elaine; Tamassia, Roberto, Signatures of correct computation, 222-242 [Zbl 1315.94098]
Asharov, Gilad; Lindell, Yehuda; Rabin, Tal, A full characterization of functions that imply fair coin tossing and ramifications to fairness, 243-262 [Zbl 1315.94051]
Jeffs, R. Amzi; Rosulek, Mike, Characterizing the cryptographic properties of reactive 2-party functionalities, 263-280 [Zbl 1315.94081]
Fehr, Serge; Katz, Jonathan; Song, Fang; Zhou, Hong-Sheng; Zikas, Vassilis, Feasibility and completeness of cryptographic tasks in the quantum world, 281-296 [Zbl 1315.94070]
Mahmoody, Mohammad; Xiao, David, Languages with efficient zero-knowledge PCPs are in SZK, 297-314 [Zbl 1315.94089]
Bitansky, Nir; Chiesa, Alessandro; Ishai, Yuval; Paneth, Omer; Ostrovsky, Rafail, Succinct non-interactive arguments via linear interactive proofs, 315-333 [Zbl 1316.68056]
Pass, Rafael, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, 334-354 [Zbl 1315.94099]
Malkin, Tal, Secure computation for big data, 355 [Zbl 1315.94090]
Boyle, Elette; Goldwasser, Shafi; Tessaro, Stefano, Communication locality in secure multi-party computation. How to run sublinear algorithms in a distributed setting, 356-376 [Zbl 1315.94063]
Lu, Steve; Ostrovsky, Rafail, Distributed oblivious RAM for secure two-party computation, 377-396 [Zbl 1315.94088]
Myers, Steven; Sergi, Mona; shelat, abhi, Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead, 397-417 [Zbl 1315.94096]
Dixit, Kashyap; Jha, Madhav; Raskhodnikova, Sofya; Thakurta, Abhradeep, Testing the Lipschitz property over product distributions with applications to data privacy, 418-436 [Zbl 1316.68208]
Haitner, Iftach; Omri, Eran; Zarosim, Hila, Limits on the usefulness of random oracles, 437-456 [Zbl 1310.94150]
Kasiviswanathan, Shiva Prasad; Nissim, Kobbi; Raskhodnikova, Sofya; Smith, Adam, Analyzing graphs with node differential privacy, 457-476 [Zbl 1316.68050]
Katz, Jonathan; Maurer, Ueli; Tackmann, Björn; Zikas, Vassilis, Universally composable synchronous computation, 477-498 [Zbl 1316.68051]
Choi, Seung Geol; Katz, Jonathan; Kumaresan, Ranjit; Cid, Carlos, Multi-client non-interactive verifiable computation, 499-518 [Zbl 1316.68053]
Lindell, Yehuda; Zarosim, Hila, On the feasibility of extending oblivious transfer, 519-538 [Zbl 1315.94086]
Hajiabadi, Mohammad; Kapron, Bruce M., Computational soundness of coinductive symbolic security under active attacks, 539-558 [Zbl 1315.94079]
Ostrovsky, Rafail; Rao, Vanishree; Scafuro, Alessandra; Visconti, Ivan, Revisiting lower and upper bounds for selective decommitments, 559-578 [Zbl 1315.94097]
Rothblum, Ron D., On the circular security of bit-encryption, 579-598 [Zbl 1315.94100]
Applebaum, Benny, Cryptographic hardness of random local functions – survey, 599 [Zbl 1315.94049]
Ishai, Yuval; Kushilevitz, Eyal; Meldgaard, Sigurd; Orlandi, Claudio; Paskin-Cherniavsky, Anat, On the power of correlated randomness in secure computation, 600-620 [Zbl 1315.94080]
Damgård, Ivan; Zakarias, Sarah, Constant-overhead secure computation of Boolean circuits using preprocessing, 621-641 [Zbl 1315.94068]
Döttling, Nico; Mie, Thilo; Müller-Quade, Jörn; Nilges, Tobias, Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens, 642-661 [Zbl 1315.94069]
Barhum, Kfir; Holenstein, Thomas, A cookbook for black-box separations and a recipe for UOWHFs, 662-679 [Zbl 1315.94053]
Catalano, Dario; Fiore, Dario; Gennaro, Rosario; Vamvourellis, Konstantinos, Algebraic (Trapdoor) one-way functions and their applications, 680-699 [Zbl 1315.94065]
Birrell, Eleanor; Chung, Kai-Min; Pass, Rafael; Telang, Sidharth, Randomness-dependent message security, 700-720 [Zbl 1315.94057]
Xiao, David, Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks, 721-722 [Zbl 1315.94109]


94-06 Proceedings, conferences, collections, etc. pertaining to information and communication theory
94A60 Cryptography
00B25 Proceedings of conferences of miscellaneous specific interest


Zbl 1238.94002
Full Text: DOI