Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar11. TCC 2014: San Diego, CA, USA
Yehuda Lindell:
Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings. Lecture Notes in Computer Science 8349, Springer 2014, ISBN 978-3-642-54241-1
Obfuscation
- Zvika Brakerski, Guy N. Rothblum:
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. 1-25 - Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. 26-51
Applications of Obfuscation
- Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova:
Two-Round Secure MPC from Indistinguishability Obfuscation. 74-94
Zero Knowledge
- Yuval Ishai, Mor Weiss:
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge. 121-145 - Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti:
Statistical Concurrent Non-malleable Zero Knowledge. 167-191 - Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti:
4-Round Resettably-Sound Zero Knowledge. 192-216
Black-Box Separations
- Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin:
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? 217-239 - Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran:
On the Power of Public-Key Encryption in Secure Computation. 240-264 - Takahiro Matsuda:
On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations. 265-290
Secure Computation
- Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz:
On the Cryptographic Complexity of the Worst Functions. 317-342 - Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto:
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. 343-367 - Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin:
Multi-linear Secret-Sharing Schemes. 394-418
Coding and Cryptographic Applications
- Mahdi Cheraghchi, Venkatesan Guruswami:
Non-malleable Coding against Bit-Wise and Split-State Tampering. 440-464 - Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuous Non-malleable Codes. 465-488 - Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky:
Locally Updatable and Locally Decodable Codes. 489-514
Leakage
- Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits and Protocols against 1/poly(k) Tampering Rate. 540-565
Encryption
- Dennis Hofheinz, Andy Rupp:
Standard versus Selective Opening Security: Separation and Equivalence Results. 591-615
Hardware-Aided Secure Protocols
- Seung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou:
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens. 638-662 - Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. 663-687
Encryption and Signatures
- Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi:
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures. 688-712 - Masayuki Abe, Jan Camenisch, Rafael Dowsley, Maria Dubovitskaya:
On the Impossibility of Structure-Preserving Deterministic Primitives. 713-738
maintained by 
, founded at 
, founded at 
last updated on 2019-02-18 22:16 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
