Остановите войну!
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 40 matches
- 2002
- Joy Algesheimer, Jan Camenisch, Victor Shoup:
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. CRYPTO 2002: 417-432 - Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott:
Efficient Algorithms for Pairing-Based Cryptosystems. CRYPTO 2002: 354-368 - Mihir Bellare, Adriana Palacio:
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. CRYPTO 2002: 162-177 - John Black, Phillip Rogaway, Thomas Shrimpton:
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. CRYPTO 2002: 320-335 - Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert:
Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209 - Emmanuel Bresson, Jacques Stern, Michael Szydlo:
Threshold Ring Signatures and Applications to Ad-hoc Groups. CRYPTO 2002: 465-480 - Jan Camenisch, Anna Lysyanskaya:
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. CRYPTO 2002: 61-76 - Ran Canetti, Hugo Krawczyk:
Security Analysis of IKE's Signature-Based Key-Exchange Protocol. CRYPTO 2002: 143-161 - Claude Carlet:
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction. CRYPTO 2002: 549-564 - Don Coppersmith, Shai Halevi, Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002: 515-532 - Jean-Sébastien Coron:
Security Proof for Partial-Domain Hash Signature Schemes. CRYPTO 2002: 613-626 - Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier:
Universal Padding Schemes for RSA. CRYPTO 2002: 226-241 - Ronald Cramer, Serge Fehr:
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. CRYPTO 2002: 272-287 - Ivan Damgård, Jesper Buus Nielsen:
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. CRYPTO 2002: 449-464 - Ivan Damgård, Jesper Buus Nielsen:
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. CRYPTO 2002: 581-596 - Serge Fehr, Ueli M. Maurer:
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. CRYPTO 2002: 565-580 - Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
On 2-Round Secure Multiparty Computation. CRYPTO 2002: 178-193 - Dani Halevy, Adi Shamir:
The LSD Broadcast Encryption Scheme. CRYPTO 2002: 47-60 - Nicholas J. Hopper, John Langford, Luis von Ahn:
Provably Secure Steganography. CRYPTO 2002: 77-92 - Gene Itkis, Leonid Reyzin:
SiBIR: Signer-Base Intrusion-Resilient Signatures. CRYPTO 2002: 499-514 - Jakob Jonsson, Burton S. Kaliski Jr.:
On the Security of RSA Encryption in TLS. CRYPTO 2002: 127-142 - Antoine Joux, Gwenaëlle Martinet, Frédéric Valette:
Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC. CRYPTO 2002: 17-30 - Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski:
Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448 - Moses D. Liskov, Ronald L. Rivest, David A. Wagner:
Tweakable Block Ciphers. CRYPTO 2002: 31-46 - Chi-Jen Lu:
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors. CRYPTO 2002: 257-271 - Anna Lysyanskaya:
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. CRYPTO 2002: 597-612 - Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson:
Threshold Password-Authenticated Key Exchange. CRYPTO 2002: 385-400 - Alexander May:
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. CRYPTO 2002: 242-256 - Ilya Mironov:
(Not So) Random Shuffles of RC4. CRYPTO 2002: 304-319 - Sean Murphy, Matthew J. B. Robshaw:
Essential Algebraic Structure within the AES. CRYPTO 2002: 1-16
skipping 10 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-04-24 06:07 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