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
- 2018
- Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. EUROCRYPT (2) 2018: 99-130 - Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. EUROCRYPT (2) 2018: 261-286 - Christian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. EUROCRYPT (2) 2018: 34-65 - Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) 2018: 649-679 - Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. EUROCRYPT (2) 2018: 354-384 - Amos Beimel, Eyal Kushilevitz, Pnina Nissim:
The Complexity of Multiparty PSM Protocols and Related Models. EUROCRYPT (2) 2018: 287-318 - Fabrice Benhamouda, Huijia Lin:
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. EUROCRYPT (2) 2018: 500-532 - Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - Roderick Bloem, Hannes Groß, Rinat Iusupov, Bettina Könighofer, Stefan Mangard, Johannes Winter:
Formal Verification of Masked Hardware Implementations in the Presence of Glitches. EUROCRYPT (2) 2018: 321-353 - Carlos Cid, Tao Huang, Thomas Peyrin, Yu Sasaki, Ling Song:
Boomerang Connectivity Table: A New Cryptanalysis Tool. EUROCRYPT (2) 2018: 683-714 - Bram Cohen, Krzysztof Pietrzak:
Simple Proofs of Sequential Work. EUROCRYPT (2) 2018: 451-467 - Henry Corrigan-Gibbs, Dmitry Kogan:
The Discrete-Logarithm Problem with Preprocessing. EUROCRYPT (2) 2018: 415-447 - Bernardo David, Peter Gazi, Aggelos Kiayias, Alexander Russell:
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. EUROCRYPT (2) 2018: 66-98 - Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
A New Approach to Black-Box Concurrent Secure Computation. EUROCRYPT (2) 2018: 566-599 - Sanjam Garg, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation from Minimal Assumptions. EUROCRYPT (2) 2018: 468-499 - Sanjam Garg, Akshayaram Srinivasan:
Adaptively Secure Garbling with Near Optimal Online Complexity. EUROCRYPT (2) 2018: 535-565 - Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan:
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. EUROCRYPT (2) 2018: 230-258 - Vincent Grosso, François-Xavier Standaert:
Masking Proofs Are Tight and How to Exploit it in Security Evaluations. EUROCRYPT (2) 2018: 385-412 - Susan Hohenberger, Brent Waters:
Synchronized Aggregate Signatures from the RSA Assumption. EUROCRYPT (2) 2018: 197-229 - Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka:
Obfustopia Built on Secret-Key Functional Encryption. EUROCRYPT (2) 2018: 603-648 - Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) 2018: 162-194 - Gaëtan Leurent, Ferdinand Sibleyras:
The Missing Difference Problem, and Its Applications to Counter Mode Encryption. EUROCRYPT (2) 2018: 745-770 - Meicheng Liu, Jingchun Yang, Wenhao Wang, Dongdai Lin:
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery. EUROCRYPT (2) 2018: 715-744 - Rafael Pass, Elaine Shi:
Thunderella: Blockchains with Optimistic Instant Confirmation. EUROCRYPT (2) 2018: 3-33 - Bin Zhang, Chao Xu, Willi Meier:
Fast Near Collision Attack on the Grain v1 Stream Cipher. EUROCRYPT (2) 2018: 771-802 - Jesper Buus Nielsen, Vincent Rijmen:
Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II. Lecture Notes in Computer Science 10821, Springer 2018, ISBN 978-3-319-78374-1 [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-18 23:26 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