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 25 matches
- 2023
- Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern:
Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation. CRYPTO (1) 2023: 39-70 - Damiano Abram, Brent Waters, Mark Zhandry:
Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. CRYPTO (1) 2023: 489-514 - Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Best of Both Worlds - Revisiting the Spymasters Double Agent Problem. CRYPTO (1) 2023: 328-359 - Benny Applebaum, Oded Nir, Benny Pinkas:
How to Recover a Secret with O(n) Additions. CRYPTO (1) 2023: 236-262 - Renas Bacho, Daniel Collins, Chen-Da Liu-Zhang, Julian Loss:
Network-Agnostic Security Comes (Almost) for Free in DKG and MPC. CRYPTO (1) 2023: 71-106 - Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou:
On Linear Communication Complexity for (Maximally) Fluid MPC. CRYPTO (1) 2023: 263-294 - Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Arithmetic Sketching. CRYPTO (1) 2023: 171-202 - Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
A Framework for Statistically Sender Private OT with Optimal Rate. CRYPTO (1) 2023: 548-576 - Lennart Braun, Ivan Damgård, Claudio Orlandi:
Secure Multiparty Computation from Threshold Encryption Based on Class Groups. CRYPTO (1) 2023: 613-645 - Hien Chu, Paul Gerhart, Tim Ruffing, Dominique Schröder:
Practical Schnorr Threshold Signatures Without the Algebraic Group Model. CRYPTO (1) 2023: 743-773 - Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - Ran Cohen, Juan A. Garay, Vassilis Zikas:
Completeness Theorems for Adaptively Secure Broadcast. CRYPTO (1) 2023: 3-38 - Elizabeth C. Crites, Chelsea Komlo, Mary Maller:
Fully Adaptive Schnorr Threshold Signatures. CRYPTO (1) 2023: 678-709 - Elizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, Chenzhi Zhu:
Snowblind: A Threshold Blind Signature in Pairing-Free Groups. CRYPTO (1) 2023: 710-742 - Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Cryptography with Weights: MPC, Encryption and Signatures. CRYPTO (1) 2023: 295-327 - Gayathri Garimella, Mike Rosulek, Jaspal Singh:
Malicious Secure, Structure-Aware Private Set Intersection. CRYPTO (1) 2023: 577-610 - Peter Gazi, Ling Ren, Alexander Russell:
Practical Settlement Bounds for Longest-Chain Consensus. CRYPTO (1) 2023: 107-138 - Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang:
Reusable Secure Computation in the Plain Model. CRYPTO (1) 2023: 427-458 - Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
Additive Randomized Encodings and Their Applications. CRYPTO (1) 2023: 203-235 - Yuval Ishai, Mahimna Kelkar, Varun Narayanan, Liav Zafar:
One-Message Secure Reductions: On the Cost of Converting Correlations. CRYPTO (1) 2023: 515-547 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box MPC in the Plain Model. CRYPTO (1) 2023: 393-426 - Ohad Klein, Ilan Komargodski:
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. CRYPTO (1) 2023: 139-170 - Yashvanth Kondi, Claudio Orlandi, Lawrence Roy:
Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. CRYPTO (1) 2023: 646-677 - Helena Handschuh, Anna Lysyanskaya:
Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14081, Springer 2023, ISBN 978-3-031-38556-8 [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-09-20 05:46 CEST 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