On the public citation graph

On the security of server-aided RSA protocols

https://doi.org/10.1007/bfb0054018
0 signed · 25 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-387-34799-2_35openalex-snapshot
Speeding Up Secret Computations with Insecure Auxiliary Devices
inferredcites →https://doi.org/10.1007/3-540-44750-4_5openalex-snapshot
Fast Server-Aided RSA Signatures Secure Against Active Attacks
inferredcites →https://doi.org/10.1007/3-540-44750-4_6openalex-snapshot
Security and Performance of Server-Aided RSA Computation Protocols
inferredcites →https://doi.org/10.1007/3-540-47555-9_13openalex-snapshot
Attacks on Protocols for Server-Aided RSA Computation
inferredcites →https://doi.org/10.1007/3-540-57220-1_70openalex-snapshot
On verifiable implicit asking protocols for RSA computation
inferredcites →https://doi.org/10.1007/3-540-68697-5_18openalex-snapshot
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
inferredcites →https://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferredcites →https://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferredcites →https://doi.org/10.1007/bf02113297openalex-snapshot
Complexity of a determinate algorithm for the discrete logarithm
inferredcites →https://doi.org/10.1007/bfb0054118openalex-snapshot
Lower bounds on generic algorithms in groups
inferredcites →https://doi.org/10.1109/sfcs.1984.715919openalex-snapshot
On The Complexity Of Matrix Group Problems I
inferredcites →https://doi.org/10.1145/100216.100295openalex-snapshot
The number field sieve

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45682-1_2openalex-snapshot
On the Insecurity of a Server-Aided RSA Protocol
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_17openalex-snapshot
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
inferred← citeshttps://doi.org/10.1007/978-3-030-20074-9_2openalex-snapshot
Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_24openalex-snapshot
Distribution of Modular Sums and the Security of the Server Aided Exponentiation
inferred← citeshttps://doi.org/10.1007/bfb0054009openalex-snapshot
Public Key Cryptography
inferred← citeshttps://doi.org/10.1093/comjnl/bxab066openalex-snapshot
Cryptanalysis of Modular Exponentiation Outsourcing Protocols
inferred← citeshttps://doi.org/10.1093/comjnl/bxz040openalex-snapshot
Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting
inferred← citeshttps://doi.org/10.1109/lightsec.2011.16openalex-snapshot
An Efficient Verifiable Implicit Asking Protocol for Diffie-Hellman Key Exchange
inferred← citeshttps://doi.org/10.1145/352600.352616openalex-snapshot
Multi-round passive attacks on server-aided RSA protocols
inferred← citeshttps://doi.org/10.1145/643477.643479openalex-snapshot
(How) can mobile agents do secure electronic transactions on untrusted hosts? A survey of the security issues and the current solutions
inferred← citeshttps://doi.org/10.11591/ijeecs.v22.i3.pp1650-1658openalex-snapshot
Methods for secure cloud processing of big data
inferred← citeshttps://doi.org/10.3934/amc.2007.1.13openalex-snapshot
Another look at generic groups
inferred← citeshttps://doi.org/10.6688/jise.2000.16.6.2openalex-snapshot
A Secure Server-Aided RSA Signature Computation Protocol for Smart Cards
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.