default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th TCC 2018: Panaji, India
- Amos Beimel, Stefan Dziembowski
:
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I. Lecture Notes in Computer Science 11239, Springer 2018, ISBN 978-3-030-03806-9
Memory-Hard Functions and Complexity Theory
- Stefano Tessaro, Aishwarya Thiruvengadam:
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries. 3-32 - Thaddeus Dryja, Quanquan C. Liu, Sunoo Park:
Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time. 33-66 - Susumu Kiyoshima:
No-signaling Linear PCPs. 67-97 - Tianren Liu:
On Basing Search SIVP on NP-Hardness. 98-119
Two-Round MPC Protocols
- Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. 123-151 - Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Perfect Secure Computation in Two Rounds. 152-174 - Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. 175-205
Zero Knowledge
- Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-malleable Commitments. 209-234 - Charanjit S. Jutla, Arnab Roy:
Smooth NIZK Arguments. 235-262 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. 263-285 - Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". 286-313
Information-Theoretic Cryptography
- Benny Applebaum, Barak Arkis:
On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. 317-344 - Daniel Jost, Ueli Maurer, João L. Ribeiro:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. 345-369 - Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. 370-388 - Varun Narayanan, Vinod M. Prabhakaran:
Oblivious Transfer in Incomplete Networks. 389-418
Trapdoor Permutations and Signatures
- Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? 421-447 - Mohammad Hajiabadi:
Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations. 448-475 - Ran Canetti, Amit Lichtenberg:
Certifying Trapdoor Permutations, Revisited. 476-506 - Andrew Morgan, Rafael Pass:
On the Security Loss of Unique Signatures. 507-536
Coin-Tossing and Fairness
- Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. 539-562 - Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-party Coin Toss. 563-596 - Andrew Morgan, Rafael Pass:
Achieving Fair Treatment in Algorithmic Classification. 597-625
Functional and Identity-Based Encryption
- Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters:
Upgrading to Functional Encryption. 629-658 - Shashank Agrawal, Venkata Koppula, Brent Waters:
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles. 659-688 - Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi:
Registration-Based Encryption: Removing Private-Key Generator from IBE. 689-718
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:17 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:
