![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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
- 1998
- William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security amplification by composition: The case of doubly-iterated, ideal ciphers. IACR Cryptol. ePrint Arch. 1998: 23 (1998) - Mihir Bellare, Ran Canetti, Hugo Krawczyk:
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. IACR Cryptol. ePrint Arch. 1998: 9 (1998) - Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway:
Relations among Notions of Security for Public-Key Encryption Schemes. IACR Cryptol. ePrint Arch. 1998: 21 (1998) - Mihir Bellare, Juan A. Garay, Tal Rabin:
Fast Batch Verification for Modular Exponentiation and Digital Signatures. IACR Cryptol. ePrint Arch. 1998: 7 (1998) - Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan:
Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. IACR Cryptol. ePrint Arch. 1998: 19 (1998) - Gerrit Bleumer:
On Protocol Divertibility. IACR Cryptol. ePrint Arch. 1998: 1 (1998) - Ran Canetti:
Security and Composition of Multi-party Cryptographic Protocols. IACR Cryptol. ePrint Arch. 1998: 18 (1998) - Ran Canetti, Oded Goldreich, Shai Halevi:
The Random Oracle Methodology, Revisited. IACR Cryptol. ePrint Arch. 1998: 11 (1998) - Ran Canetti, Shai Halevi, Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins. IACR Cryptol. ePrint Arch. 1998: 12 (1998) - Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. IACR Cryptol. ePrint Arch. 1998: 14 (1998) - Hoi Fung Chau, Hoi-Kwong Lo:
Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment). IACR Cryptol. ePrint Arch. 1998: 17 (1998) - Benny Chor, Niv Gilboa, Moni Naor:
Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. 1998: 3 (1998) - Ronald Cramer, Victor Shoup:
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. IACR Cryptol. ePrint Arch. 1998: 6 (1998) - Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Universal Service Providers for Database Private Information Retrieval. IACR Cryptol. ePrint Arch. 1998: 4 (1998) - Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. IACR Cryptol. ePrint Arch. 1998: 25 (1998) - Rosario Gennaro, Daniele Micciancio, Tal Rabin:
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. IACR Cryptol. ePrint Arch. 1998: 8 (1998) - Yael Gertner, Shafi Goldwasser, Tal Malkin:
A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication). IACR Cryptol. ePrint Arch. 1998: 13 (1998) - Oded Goldreich, Shafi Goldwasser:
On the possibility of basing Cryptography on the assumption that P ≠ NP. IACR Cryptol. ePrint Arch. 1998: 5 (1998) - Oded Goldreich, Salil P. Vadhan:
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. IACR Cryptol. ePrint Arch. 1998: 26 (1998) - Shai Halevi, Silvio Micali:
More on Proofs of Knowledge. IACR Cryptol. ePrint Arch. 1998: 15 (1998) - Hugo Krawczyk, Tal Rabin:
Chameleon Hashing and Signatures. IACR Cryptol. ePrint Arch. 1998: 10 (1998) - Hoi-Kwong Lo:
Insecurity of Quantum Computations. IACR Cryptol. ePrint Arch. 1998: 22 (1998) - John O. Pliam:
The Disparity between Work and Entropy in Cryptology. IACR Cryptol. ePrint Arch. 1998: 24 (1998) - Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. IACR Cryptol. ePrint Arch. 1998: 2 (1998) - Claus-Peter Schnorr:
Almost All Discrete Log Bits Are Simultaneously Secure. IACR Cryptol. ePrint Arch. 1998: 20 (1998) - (Withdrawn) Quantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distances. IACR Cryptol. ePrint Arch. 1998: 16 (1998)
loading more results
failed to load more results, please try again later
![](https://dblp.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-09-03 22:39 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