Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th TCC 2017: Baltimore, MD, USA
- Yael Kalai, Leonid Reyzin:
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10677, Springer 2017, ISBN 978-3-319-70499-9
Impossibilities and Barriers
- Bo Tang, Jiapeng Zhang:
Barriers to Black-Box Constructions of Traitor Tracing Systems. 3-30 - Shachar Lovett
, Jiapeng Zhang:
On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs. 31-55 - Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak:
Position-Based Cryptography and Multiparty Communication Complexity. 56-81 - Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
When Does Functional Encryption Imply Obfuscation? 82-115
Obfuscation
- Alex Lombardi, Vinod Vaikuntanathan:
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. 119-137 - Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. 138-169
Functional Encryption
- Shweta Agrawal, Alon Rosen:
Functional Encryption for Bounded Collusions, Revisited. 173-205 - Hoeteck Wee:
Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited. 206-233
Constrained PRFs
- Dan Boneh, Sam Kim, David J. Wu:
Constrained Keys for Invertible Pseudorandom Functions. 237-263 - Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. 264-302
Encryption
- Shafi Goldwasser, Saleet Klein, Daniel Wichs:
The Edited Truth. 305-340 - Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz:
A Modular Analysis of the Fujisaki-Okamoto Transformation. 341-371 - Nico Döttling, Sanjam Garg:
From Selective IBE to Full IBE and Selective HIBE. 372-408 - Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. 409-441
Moderately Hard Functions
- Jeremiah Blocki, Samson Zhou:
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. 445-465 - Ling Ren, Srinivas Devadas:
Bandwidth Hard Functions for ASIC Resistance. 466-492 - Joël Alwen, Björn Tackmann:
Moderately Hard Functions: Definition, Instantiations, and Applications. 493-526
Blockchains
- Rishab Goyal, Vipul Goyal:
Overcoming Cryptographic Impossibility Results Using Blockchains. 529-561
Multiparty Computation
- Yehuda Lindell, Tal Rabin:
Secure Two-Party Computation with Fairness - A Necessary Design Principle. 565-580 - Vanesa Daza, Nikolaos Makriyannis:
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions. 581-611 - Prabhanjan Ananth, Abhishek Jain:
On Secure Two-Party Computation in Three Rounds. 612-644 - Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou:
Four Round Secure Computation Without Setup. 645-677 - Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. 678-710 - Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. 711-742 - Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, Amit Sahai:
Round Optimal Concurrent MPC via Strong Simulation. 743-775 - Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. 776-809
a service of 
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-04-25 04:51 CEST 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:
