On the public citation graph

A comment on the efficiency of secret sharing scheme over any finite abelian group

https://doi.org/10.1007/bfb0053750
0 signed · 19 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-34805-0_28openalex-snapshot
Threshold cryptosystems
inferredcites →https://doi.org/10.1007/3-540-68339-9_10openalex-snapshot
Efficient Multiplicative Sharing Schemes
inferredcites →https://doi.org/10.1007/bfb0000421openalex-snapshot
Multiplicative non-abelian sharing schemes and their application to threshold cryptography
inferredcites →https://doi.org/10.1007/bfb0086551openalex-snapshot
On cliques of exceptional units and Lenstra's construction of Euclidean fields
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1137/s0895480192224713openalex-snapshot
Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
inferredcites →https://doi.org/10.1145/195058.195405openalex-snapshot
How to share a function securely
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10718964_36openalex-snapshot
Algorithms to Speed Up Computations in Threshold RSA
inferred← citeshttps://doi.org/10.1007/10719994_15openalex-snapshot
A New Approach to Robust Threshold RSA Signature Schemes
inferred← citeshttps://doi.org/10.1007/11506157_32openalex-snapshot
An Efficient Implementation of a Threshold RSA Signature Scheme
inferred← citeshttps://doi.org/10.1007/11535218_21openalex-snapshot
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_27openalex-snapshot
Improved Methods to Perform Threshold RSA
inferred← citeshttps://doi.org/10.1007/3-540-45450-0_7openalex-snapshot
Requirements for Group Independent Linear Threshold Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_18openalex-snapshot
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_30openalex-snapshot
Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_26openalex-snapshot
Robust Additive Secret Sharing Schemes over Z m
inferred← citeshttps://doi.org/10.1145/2414456.2414507openalex-snapshot
CL-PRE
inferred← citeshttps://doi.org/10.7146/brics.v9i8.21726openalex-snapshot
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
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.