Остановите войну!
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
- 2016
- Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. CRYPTO (2) 2016: 659-680 - Joël Alwen, Jeremiah Blocki:
Efficiently Computing Data-Independent Memory-Hard Functions. CRYPTO (2) 2016: 241-271 - Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) 2016: 491-520 - Christof Beierle, Jérémy Jean, Stefan Kölbl, Gregor Leander, Amir Moradi, Thomas Peyrin, Yu Sasaki, Pascal Sasdrich, Siang Meng Sim:
The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS. CRYPTO (2) 2016: 123-153 - Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost for Free. CRYPTO (2) 2016: 62-89 - Zvika Brakerski, Christina Brzuska, Nils Fleischhacker:
On Statistically Secure Obfuscation with Approximate Correctness. CRYPTO (2) 2016: 551-578 - Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi:
Cryptanalysis of GGH15 Multilinear Maps. CRYPTO (2) 2016: 607-628 - Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin:
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) 2016: 459-488 - Patrick Derbez, Pierre-Alain Fouque:
Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks. CRYPTO (2) 2016: 157-184 - Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir:
Memory-Efficient Algorithms for Finding Needles in Haystacks. CRYPTO (2) 2016: 185-206 - Stefan Dziembowski, Sebastian Faust, Gottfried Herold, Anthony Journault, Daniel Masny, François-Xavier Standaert:
Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems. CRYPTO (2) 2016: 272-301 - Marc Fischlin, Amir Herzberg, Hod Bin Noon, Haya Schulmann:
Obfuscation Combiners. CRYPTO (2) 2016: 521-550 - Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. CRYPTO (2) 2016: 579-604 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On the Power of Secure Two-Party Computation. CRYPTO (2) 2016: 397-429 - Martin Hirt, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
Network-Hiding Communication and Applications to Multi-party Protocols. CRYPTO (2) 2016: 335-365 - Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. CRYPTO (2) 2016: 430-458 - Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Breaking Symmetric Cryptosystems Using Quantum Period Finding. CRYPTO (2) 2016: 207-237 - Eike Kiltz, Daniel Masny, Jiaxin Pan:
Optimal Security Proofs for Signatures from Identification Schemes. CRYPTO (2) 2016: 33-61 - Venkata Koppula, Brent Waters:
Circular Security Separations for Arbitrary Length Cycles from LWE. CRYPTO (2) 2016: 681-700 - Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. CRYPTO (2) 2016: 366-396 - Eric Miles, Amit Sahai, Mark Zhandry:
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. CRYPTO (2) 2016: 629-658 - Léo Perrin, Aleksei Udovenko, Alex Biryukov:
Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem. CRYPTO (2) 2016: 93-122 - Tobias Schneider, Amir Moradi, Tim Güneysu:
ParTI - Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks. CRYPTO (2) 2016: 302-332 - Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro:
Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli. CRYPTO (2) 2016: 3-32 - Matthew Robshaw, Jonathan Katz:
Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9815, Springer 2016, ISBN 978-3-662-53007-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-04-27 20:05 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