default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2022
- Behzad Abdolmaleki, Nils Fleischhacker, Vipul Goyal, Abhishek Jain, Giulio Malavolta:
Steganography-Free Zero-Knowledge. TCC (1) 2022: 143-172 - Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC (1) 2022: 384-414 - Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) 2022: 327-354 - Shweta Agrawal, Rishab Goyal, Junichi Tomida:
Multi-Input Quadratic Functional Encryption: Stronger Security, Broader Functionality. TCC (1) 2022: 711-740 - Shweta Agrawal, Fuyuki Kitagawa, Anuja Modi, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa:
Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions. TCC (1) 2022: 618-647 - Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi:
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols. TCC (1) 2022: 266-293 - Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications. TCC (1) 2022: 237-265 - Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev:
A Toolbox for Barriers on Interactive Oracle Proofs. TCC (1) 2022: 447-466 - Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed $\varSigma $-Protocols. TCC (1) 2022: 173-202 - Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-round Interactive Proofs. TCC (1) 2022: 113-142 - Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. TCC (1) 2022: 417-446 - Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) 2022: 467-496 - Jeremiah Blocki, Blake Holman, Seunghoon Lee:
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs. TCC (1) 2022: 52-79 - Jelle Don, Serge Fehr, Yu-Hsuan Huang:
Adaptive Versus Static Multi-oracle Algorithms, and Quantum Security of a Split-Key PRF. TCC (1) 2022: 33-51 - Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. TCC (1) 2022: 588-617 - Rachit Garg, Kristin Sheridan, Brent Waters, David J. Wu:
Fully Succinct Batch Arguments for sfNP from Indistinguishability Obfuscation. TCC (1) 2022: 526-555 - Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner:
Quantum Rewinding for Many-Round Protocols. TCC (1) 2022: 80-109 - Hanjun Li, Huijia Lin, Ji Luo:
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security. TCC (1) 2022: 680-710 - Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry:
Collusion Resistant Copy-Protection for Watermarkable Functionalities. TCC (1) 2022: 294-323 - Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-quantum Insecurity from LWE. TCC (1) 2022: 3-32 - Anna Lysyanskaya, Leah Namisa Rosenbloom:
Universally Composable $\varSigma $-protocols in the Global Random-Oracle Model. TCC (1) 2022: 203-233 - Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi:
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. TCC (1) 2022: 559-587 - Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. TCC (1) 2022: 355-383 - Eduardo Soria-Vazquez:
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings. TCC (1) 2022: 497-525 - Brent Waters, Hoeteck Wee, David J. Wu:
Multi-authority ABE from Lattices Without Random Oracles. TCC (1) 2022: 651-679 - Eike Kiltz, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I. Lecture Notes in Computer Science 13747, Springer 2022, ISBN 978-3-031-22317-4 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-14 09:01 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint