Остановите войну!
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 33 matches
- 2008
- Joël Alwen, Abhi Shelat, Ivan Visconti:
Collusion-Free Protocols in the Mediated Model. CRYPTO 2008: 497-514 - Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468 - Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart:
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. CRYPTO 2008: 360-378 - Eli Biham, Yaniv Carmeli, Adi Shamir:
Bug Attacks. CRYPTO 2008: 221-240 - Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. CRYPTO 2008: 335-359 - Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky:
Circular-Secure Encryption from Decision Diffie-Hellman. CRYPTO 2008: 108-125 - Christophe De Cannière, Christian Rechberger:
Preimages for Reduced SHA-0 and SHA-1. CRYPTO 2008: 179-202 - Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model Are Equivalent. CRYPTO 2008: 1-20 - Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam D. Smith:
Scalable Multiparty Computation with Nearly Optimal Work and Resilience. CRYPTO 2008: 241-261 - Cécile Delerablée, David Pointcheval:
Dynamic Threshold Public-Key Encryption. CRYPTO 2008: 317-334 - Yevgeniy Dodis, Victor Shoup, Shabsi Walfish:
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs. CRYPTO 2008: 515-535 - Cynthia Dwork, Sergey Yekhanin:
New Efficient Attacks on Statistical Disclosure Control Mechanisms. CRYPTO 2008: 469-480 - Thomas Eisenbarth, Timo Kasper, Amir Moradi, Christof Paar, Mahmoud Salmasizadeh, Mohammad T. Manzuri Shalmani:
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoqCode Hopping Scheme. CRYPTO 2008: 203-220 - Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret:
Cryptanalysis of MinRank. CRYPTO 2008: 280-296 - Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam:
Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO 2008: 93-107 - Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
One-Time Programs. CRYPTO 2008: 39-56 - Helena Handschuh, Bart Preneel:
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms. CRYPTO 2008: 144-161 - Brett Hemenway, Rafail Ostrovsky:
Public-Key Locally-Decodable Codes. CRYPTO 2008: 126-143 - Dennis Hofheinz, Eike Kiltz:
Programmable Hash Functions and Their Applications. CRYPTO 2008: 21-38 - Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Founding Cryptography on Oblivious Transfer - Efficiently. CRYPTO 2008: 572-591 - Dimitar Jetchev, Ramarathnam Venkatesan:
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys. CRYPTO 2008: 75-92 - Alexander Maximov, Dmitry Khovratovich:
New State Recovery Attack on RC4. CRYPTO 2008: 297-316 - Florian Mendel, Norbert Pramstaller, Christian Rechberger, Marcin Kontak, Janusz Szmidt:
Cryptanalysis of the GOST Hash Function. CRYPTO 2008: 162-178 - Payman Mohassel, Enav Weinreb:
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. CRYPTO 2008: 481-496 - Rafail Ostrovsky, William E. Skeith III:
Communication Complexity in Algebraic Two-Party Protocols. CRYPTO 2008: 379-396 - Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan:
Adaptive One-Way Functions and Applications. CRYPTO 2008: 57-74 - Chris Peikert, Vinod Vaikuntanathan:
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. CRYPTO 2008: 536-553 - Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer. CRYPTO 2008: 554-571 - Krzysztof Pietrzak:
Compression from Collisions, or Why CRHF Combiners Have a Long Output. CRYPTO 2008: 413-432 - Manoj Prabhakaran, Mike Rosulek:
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations. CRYPTO 2008: 262-279
skipping 3 more matches
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-12 12:02 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