![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 29 matches
- 2003
- Mihir Bellare, Bennet S. Yee:
Forward-Security in Private-Key Cryptography. CT-RSA 2003: 1-18 - Thomas A. Berson:
Cryptography after the Bubble: How to Make an Impact on the World. CT-RSA 2003: 226 - Guido Bertoni
, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas J. Wollinger:
Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications. CT-RSA 2003: 158-175 - Dan Boneh, Ilya Mironov, Victor Shoup:
A Secure Signature Scheme from Bilinear Maps. CT-RSA 2003: 98-110 - Nicolas T. Courtois, Jacques Patarin:
About the XL Algorithm over GF(2). CT-RSA 2003: 141-157 - Claude Crépeau, Alain Slakmon:
Simple Backdoors for RSA Key Generation. CT-RSA 2003: 403-416 - Paolo D'Arco, Douglas R. Stinson:
Fault Tolerant and DistributedBroadcast Encryption. CT-RSA 2003: 263-280 - Xuhua Ding
, Gene Tsudik:
Simple Identity-Based Cryptography with Mediated RSA. CT-RSA 2003: 193-210 - Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji
, Moti Yung:
Intrusion-Resilient Public-Key Encryption. CT-RSA 2003: 19-32 - Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. CT-RSA 2003: 343-354 - Steven D. Galbraith, Wenbo Mao:
Invisibility and Anonymity of Undeniable and Confirmer Signatures. CT-RSA 2003: 80-97 - Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin:
Secure Applications of Pedersen's Distributed Key Generation Protocol. CT-RSA 2003: 373-390 - Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen:
Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313 - Jeffrey Hoffstein
, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte:
NTRUSIGN: Digital Signatures Using the NTRU Lattice. CT-RSA 2003: 122-140 - Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo:
Fractal Merkle Tree Representation and Traversal. CT-RSA 2003: 314-326 - Seungjoo Kim
, Masahiro Mambo, Yuliang Zheng
:
Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption. CT-RSA 2003: 227-243 - Kaoru Kurosawa, Tetsu Iwata:
TMAC: Two-Key CBC MAC. CT-RSA 2003: 33-49 - Jung-Yeun Lee, Jung Hee Cheon, Seungjoo Kim
:
An Analysis of Proxy Signatures: Is a Secure Channel Necessary? CT-RSA 2003: 68-79 - John Malone-Lee, Wenbo Mao:
Two Birds One Stone: Signcryption Using RSA. CT-RSA 2003: 211-225 - Bodo Möller:
Provably Secure Public-Key Encryptionfor Length-Preserving Chaumian Mixes. CT-RSA 2003: 244-262 - Katsuyuki Okeya, Tsuyoshi Takagi:
The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks. CT-RSA 2003: 328-342 - Adi Shamir:
RSA Shortcuts. CT-RSA 2003: 327 - Nigel P. Smart:
Access Control Using Pairing Based Cryptography. CT-RSA 2003: 111-121 - Colin D. Walter:
Seeing through MIST Given a Small Fraction of an RSA Private Key. CT-RSA 2003: 391-402 - Huaxiong Wang, Josef Pieprzyk
:
Shared Generation of Pseudo-Random Functions with Cumulative Maps. CT-RSA 2003: 281-294 - Douglas L. Whiting, Michael J. Sabin:
Montgomery Prime Hashing for Message Authentication. CT-RSA 2003: 50-67 - Lu Xiao, Howard M. Heys
:
Hardware Performance Characterization of Block Cipher Structures. CT-RSA 2003: 176-192 - Shouhuai Xu, Ravi S. Sandhu:
Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures. CT-RSA 2003: 355-372 - Marc Joye:
Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings. Lecture Notes in Computer Science 2612, Springer 2003, ISBN 3-540-00847-0 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-29 22:21 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