Остановите войну!
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 113 matches
- 2001
- Amod Agashe, Kristin E. Lauter, Ramarathnam Venkatesan:
Constructing elliptic curves with a given number of points over a finite field. IACR Cryptol. ePrint Arch. 2001: 96 (2001) - Jee Hea An:
Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses. IACR Cryptol. ePrint Arch. 2001: 79 (2001) - Giuseppe Ateniese, Dawn Song, Gene Tsudik:
Quasi-Efficient Revocation of Group Signatures. IACR Cryptol. ePrint Arch. 2001: 101 (2001) - Steve Babbage:
The COS Stream Ciphers are Extremely Weak. IACR Cryptol. ePrint Arch. 2001: 78 (2001) - Steve Babbage:
Cryptanalysis of the COS (2, 128) Stream Ciphers. IACR Cryptol. ePrint Arch. 2001: 106 (2001) - Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. IACR Cryptol. ePrint Arch. 2001: 105 (2001) - Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptol. ePrint Arch. 2001: 63 (2001) - Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. IACR Cryptol. ePrint Arch. 2001: 69 (2001) - Paulo S. L. M. Barreto, Hae Yong Kim:
Fast hashing onto elliptic curves over fields of characteristic 3. IACR Cryptol. ePrint Arch. 2001: 98 (2001) - Birgit Baum-Waidner:
Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds. IACR Cryptol. ePrint Arch. 2001: 44 (2001) - Amos Beimel, Yuval Ishai:
On the Power of Nonlinear Secret-Sharing. IACR Cryptol. ePrint Arch. 2001: 30 (2001) - Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko:
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. IACR Cryptol. ePrint Arch. 2001: 2 (2001) - Mihir Bellare, Ravi S. Sandhu:
The Security of Practical Two-Party RSA Signature Schemes. IACR Cryptol. ePrint Arch. 2001: 60 (2001) - Mihir Bellare, Bennet S. Yee:
Forward-Security in Private-Key Cryptography. IACR Cryptol. ePrint Arch. 2001: 35 (2001) - Antonio Bellezza:
Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems. IACR Cryptol. ePrint Arch. 2001: 103 (2001) - Eli Biham, Orr Dunkelman, Nathan Keller:
The Rectangle Attack - Rectangling the Serpent. IACR Cryptol. ePrint Arch. 2001: 21 (2001) - John Black, Phillip Rogaway:
Ciphers with Arbitrary Finite Domains. IACR Cryptol. ePrint Arch. 2001: 12 (2001) - John Black, Phillip Rogaway:
A Block-Cipher Mode of Operation for Parallelizable Message Authentication. IACR Cryptol. ePrint Arch. 2001: 27 (2001) - Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. IACR Cryptol. ePrint Arch. 2001: 87 (2001) - Dan Boneh, Matthew K. Franklin:
Identity Based Encryption From the Weil Pairing. IACR Cryptol. ePrint Arch. 2001: 90 (2001) - Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup:
Secure and Efficient Asynchronous Broadcast Protocols. IACR Cryptol. ePrint Arch. 2001: 6 (2001) - Jan Camenisch, Anna Lysyanskaya:
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. IACR Cryptol. ePrint Arch. 2001: 19 (2001) - Jan Camenisch, Anna Lysyanskaya:
Efficient Revocation of Anonymous Group Membership. IACR Cryptol. ePrint Arch. 2001: 113 (2001) - Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
On adaptive vs. non-adaptive security of multiparty protocols. IACR Cryptol. ePrint Arch. 2001: 17 (2001) - Ran Canetti, Marc Fischlin:
Universally Composable Commitments. IACR Cryptol. ePrint Arch. 2001: 55 (2001) - Ran Canetti, Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. IACR Cryptol. ePrint Arch. 2001: 40 (2001) - Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptol. ePrint Arch. 2001: 51 (2001) - M. A. Chateauneuf, Alan C. H. Ling, Douglas R. Stinson:
Slope packings and coverings, and generic algorithms for the discrete logarithm problem. IACR Cryptol. ePrint Arch. 2001: 94 (2001) - Jean-Sébastien Coron:
Optimal security proofs for PSS and other signature schemes. IACR Cryptol. ePrint Arch. 2001: 62 (2001) - Nicolas T. Courtois:
On multivariate signature-only public key cryptosystems. IACR Cryptol. ePrint Arch. 2001: 29 (2001)
skipping 83 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-05 15:45 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