![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 40 matches
- 1999
- Masayuki Abe:
Robust Distributed Multiplicaton with out Interaction. CRYPTO 1999: 130-147 - Jee Hea An, Mihir Bellare:
Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions. CRYPTO 1999: 252-269 - Yonatan Aumann, Michael O. Rabin:
Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999: 65-79 - Amos Beimel, Tal Malkin, Silvio Micali:
The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97 - Mihir Bellare, Oded Goldreich, Hugo Krawczyk:
Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. CRYPTO 1999: 270-287 - Mihir Bellare, Sara K. Miner:
A Forward-Secure Digital Signature Scheme. CRYPTO 1999: 431-448 - Mihir Bellare, Amit Sahai:
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization. CRYPTO 1999: 519-536 - John Black, Shai Halevi, Hugo Krawczyk, Ted Krovetz
, Phillip Rogaway:
UMAC: Fast and Secure Message Authentication. CRYPTO 1999: 216-233 - Dan Boneh, Glenn Durfee, Nick Howgrave-Graham:
Factoring N = prq for Large r. CRYPTO 1999: 326-337 - Dan Boneh, Matthew K. Franklin:
An Efficient Public Key Traitor Tracing Scheme. CRYPTO 1999: 338-353 - Victor Boyko:
On the Security Properties of OAEP as an All-or-Nothing Transform. CRYPTO 1999: 503-518 - Jan Camenisch, Markus Michels:
Separability and Efficiency for Generic Group Signature Schemes. CRYPTO 1999: 413-430 - Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin:
Adaptive Security for Threshold Cryptosystems. CRYPTO 1999: 98-115 - Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, Pankaj Rohatgi:
Towards Sound Approaches to Counteract Power-Analysis Attacks. CRYPTO 1999: 398-412 - Don Coppersmith:
Weakness in Quaternion Signatures. CRYPTO 1999: 305-314 - Jean-Sébastien Coron, David Naccache, Julien P. Stern:
On the Security of RSA Padding. CRYPTO 1999: 1-18 - Giovanni Di Crescenzo, Rafail Ostrovsky:
On Concurrent Zero-Knowledge with Pre-processing. CRYPTO 1999: 485-502 - Mark Etzel, Sarvar Patel, Zulfikar Ramzan:
SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions. CRYPTO 1999: 234-251 - Amos Fiat, Tamir Tassa:
Dynamic Traitor Training. CRYPTO 1999: 354-371 - Eiichiro Fujisaki, Tatsuaki Okamoto:
Secure Integration of Asymmetric and Symmetric Encryption Schemes. CRYPTO 1999: 537-554 - Eli Gafni, Jessica Staddon, Yiqun Lisa Yin:
Efficient Methods for Integrating Traceability and Broadcast Encryption. CRYPTO 1999: 372-387 - Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie:
Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466 - Niv Gilboa:
Two Party RSA Key Generation. CRYPTO 1999: 116-129 - Niv Gilboa, Yuval Ishai:
Compressing Cryptographic Resources. CRYPTO 1999: 591-608 - Oded Goldreich, Amit Sahai, Salil P. Vadhan:
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. CRYPTO 1999: 467-484 - Thomas Johansson
, Fredrik Jönsson
:
Fast Correlation Attacks Based on Turbo Code Techniques. CRYPTO 1999: 181-197 - Aviad Kipnis, Adi Shamir:
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. CRYPTO 1999: 19-30 - Lars R. Knudsen, Matthew J. B. Robshaw, David A. Wagner:
Truncated Differentials and Skipjack. CRYPTO 1999: 165-180 - Paul C. Kocher, Joshua Jaffe, Benjamin Jun:
Differential Power Analysis. CRYPTO 1999: 388-397 - Ravi Kumar, Sridhar Rajagopalan, Amit Sahai:
Coding Constructions for Blacklisting Problems without Computational Assumptions. CRYPTO 1999: 609-623
skipping 10 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-12 12:00 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