Остановите войну!
for scientists:
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
- 2017
- Michel Abdalla, Romain Gay, Mariana Raykova, Hoeteck Wee:
Multi-input Inner-Product Functional Encryption from Pairings. EUROCRYPT (1) 2017: 601-626 - Shashank Agrawal, Melissa Chase:
Simplifying Design and Analysis of Complex Predicate Encryption Schemes. EUROCRYPT (1) 2017: 627-656 - Prabhanjan Ananth, Aayush Jain, Amit Sahai:
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. EUROCRYPT (1) 2017: 91-121 - Prabhanjan Ananth, Amit Sahai:
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps. EUROCRYPT (1) 2017: 152-181 - Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs. EUROCRYPT (1) 2017: 382-411 - Gilles Barthe, François Dupressoir, Sebastian Faust, Benjamin Grégoire, François-Xavier Standaert, Pierre-Yves Strub:
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model. EUROCRYPT (1) 2017: 535-566 - Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short Generators Without Quantum Computers: The Case of Multiquadratics. EUROCRYPT (1) 2017: 27-59 - Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. EUROCRYPT (1) 2017: 60-88 - Dan Boneh, Sam Kim, Hart William Montgomery:
Private Puncturable PRFs from Standard Lattice Assumptions. EUROCRYPT (1) 2017: 415-445 - Brandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller-Quade, Matthias Nagel:
Concurrently Composable Security with Shielded Super-Polynomial Simulators. EUROCRYPT (1) 2017: 351-381 - Ran Canetti, Yilei Chen:
Constraint-Hiding Constrained PRFs for NC1 from LWE. EUROCRYPT (1) 2017: 446-476 - Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient Compression of SIDH Public Keys. EUROCRYPT (1) 2017: 679-706 - Ronald Cramer, Léo Ducas, Benjamin Wesolowski:
Short Stickelberger Class Relations and Application to Ideal-SVP. EUROCRYPT (1) 2017: 324-348 - Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan:
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) 2017: 479-500 - Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé:
A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) 2017: 202-231 - Dahmun Goudarzi, Matthieu Rivain:
How Fast Can Higher-Order Masking Be in Software? EUROCRYPT (1) 2017: 567-597 - Paul Kirchner, Pierre-Alain Fouque:
Revisiting Lattice Attacks on Overstretched NTRU Parameters. EUROCRYPT (1) 2017: 3-26 - Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke:
Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) 2017: 185-201 - David Kohel:
Twisted μ4-Normal Form for Elliptic Curves. EUROCRYPT (1) 2017: 659-678 - Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. EUROCRYPT (1) 2017: 122-151 - Vadim Lyubashevsky, Gregory Neven:
One-Shot Verifiable Encryption from Lattices. EUROCRYPT (1) 2017: 293-323 - Payman Mohassel, Mike Rosulek, Alessandra Scafuro:
Sublinear Zero-Knowledge Arguments for RAM Programs. EUROCRYPT (1) 2017: 501-531 - Rafael Pass, Elaine Shi, Florian Tramèr:
Formal Abstractions for Attested Execution Secure Processors. EUROCRYPT (1) 2017: 260-289 - Peter Rindal, Mike Rosulek:
Improved Private Set Intersection Against Malicious Adversaries. EUROCRYPT (1) 2017: 235-259 - Jean-Sébastien Coron, Jesper Buus Nielsen:
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10210, 2017, ISBN 978-3-319-56619-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-06-16 02:49 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