![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
- 2017
- Shweta Agrawal:
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks. CRYPTO (1) 2017: 3-35 - Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on All Graphs. CRYPTO (1) 2017: 447-467 - Miguel Ambrona
, Gilles Barthe, Benedikt Schmidt:
Generic Transformations of Predicate Encodings: Constructions and Applications. CRYPTO (1) 2017: 36-66 - Prabhanjan Ananth, Arka Rai Choudhuri
, Abhishek Jain:
A New Approach to Round-Optimal Secure Multiparty Computation. CRYPTO (1) 2017: 468-499 - Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. CRYPTO (1) 2017: 727-757 - Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron:
Secure Arithmetic Computation with Constant Computational Overhead. CRYPTO (1) 2017: 223-254 - Benedikt Auerbach
, David Cash, Manuel Fersch, Eike Kiltz
:
Memory-Tight Reductions. CRYPTO (1) 2017: 101-132 - Christian Badertscher
, Ueli Maurer, Daniel Tschudi
, Vassilis Zikas:
Bitcoin as a Transaction Ledger: A Composable Treatment. CRYPTO (1) 2017: 324-356 - Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay
:
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption. CRYPTO (1) 2017: 67-98 - Fabrice Benhamouda
, Hugo Krawczyk, Tal Rabin:
Robust Non-interactive Multiparty Computation Against Constant-Size Collusion. CRYPTO (1) 2017: 391-419 - Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs. Hardness Through the Obfuscation Lens. CRYPTO (1) 2017: 696-723 - Guilhem Castagnos, Laurent Imbert, Fabien Laguillaumie:
Encryption Switching Protocols Revisited: Switching Modulo p. CRYPTO (1) 2017: 255-287 - Ivan Damgård, Jesper Buus Nielsen
, Michael Nielsen, Samuel Ranellucci:
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. CRYPTO (1) 2017: 167-187 - Nico Döttling, Sanjam Garg:
Identity-Based Encryption from the Diffie-Hellman Assumption. CRYPTO (1) 2017: 537-569 - Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
The Price of Low Communication in Secure Multi-party Computation. CRYPTO (1) 2017: 420-446 - Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. CRYPTO (1) 2017: 291-323 - Sanjam Garg, Mohammad Mahmoody
, Ameer Mohammed:
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. CRYPTO (1) 2017: 661-695 - Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. CRYPTO (1) 2017: 133-163 - Aggelos Kiayias, Alexander Russell
, Bernardo David, Roman Oliynykov
:
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. CRYPTO (1) 2017: 357-388 - Sam Kim, David J. Wu:
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions. CRYPTO (1) 2017: 503-536 - Yashvanth Kondi, Arpita Patra:
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO (1) 2017: 188-222 - Huijia Lin:
Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs. CRYPTO (1) 2017: 599-629 - Huijia Lin, Stefano Tessaro:
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs. CRYPTO (1) 2017: 630-660 - Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Conditional Disclosure of Secrets via Non-linear Reconstruction. CRYPTO (1) 2017: 758-790 - Marc Stevens
, Elie Bursztein, Pierre Karpman, Ange Albertini, Yarik Markov:
The First Collision for Full SHA-1. CRYPTO (1) 2017: 570-596 - Jonathan Katz, Hovav Shacham:
Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10401, Springer 2017, ISBN 978-3-319-63687-0 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-24 11:16 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