On the public citation graph

Multiplicative non-abelian sharing schemes and their application to threshold cryptography

https://doi.org/10.1007/bfb0000421
0 signed · 60 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_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/0-387-34805-0_28openalex-snapshot
Threshold cryptosystems
inferredcites →https://doi.org/10.1007/3-540-39118-5_13openalex-snapshot
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-46416-6_20openalex-snapshot
Distributed Provers with Applications to Undeniable Signatures
inferredcites →https://doi.org/10.1007/3-540-46766-1_37openalex-snapshot
Shared generation of authenticators and signatures
inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_28openalex-snapshot
Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/isit.1994.395112openalex-snapshot
Exponentiation-based key generation using noncommutative groups
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1987.49openalex-snapshot
Random self-reducibility and zero knowledge interactive proofs of possession of information
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0895480192224713openalex-snapshot
Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
inferredcites →https://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferredcites →https://doi.org/10.1145/195058.195405openalex-snapshot
How to share a function securely
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359460.359473openalex-snapshot
Secure communications over insecure channels
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.

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_28openalex-snapshot
On Multiplicative Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/10719994_15openalex-snapshot
A New Approach to Robust Threshold RSA Signature Schemes
inferred← citeshttps://doi.org/10.1007/10958513_30openalex-snapshot
Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_32openalex-snapshot
Forward-Secure Threshold Signature Schemes
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/3-540-49649-1_30openalex-snapshot
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_31openalex-snapshot
Audio and Optical Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_10openalex-snapshot
Efficient Multiplicative Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_9openalex-snapshot
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_330openalex-snapshot
Threshold Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-31578-8_16openalex-snapshot
Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-62576-4_17openalex-snapshot
Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_330openalex-snapshot
Threshold Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-86599-2_5openalex-snapshot
Enhancing Threshold Group Action Signature Schemes: Adaptive Security and Scalability Improvements
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_2openalex-snapshot
IND-CCA Lattice Threshold KEM Under 30 KiB
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.1007/978-3-540-24591-9_32openalex-snapshot
A Comment on Group Independent Threshold Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-30598-9_7openalex-snapshot
Threshold Cryptography in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_330-2openalex-snapshot
Threshold Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-32284-6_9openalex-snapshot
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
inferred← citeshttps://doi.org/10.1007/bfb0028171openalex-snapshot
On ideal non-perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bfb0030418openalex-snapshot
Some recent research aspects of threshold cryptography
inferred← citeshttps://doi.org/10.1007/bfb0053750openalex-snapshot
A comment on the efficiency of secret sharing scheme over any finite abelian group
inferred← citeshttps://doi.org/10.1007/s11042-020-08695-yopenalex-snapshot
Smart expansion of target key for more handlers to access multimedia counting-based secret sharing
inferred← citeshttps://doi.org/10.1007/s13369-020-04422-9openalex-snapshot
Trustworthy Target Key Alteration Helping Counting-Based Secret Sharing Applicability
inferred← citeshttps://doi.org/10.1109/acsac.2000.898857openalex-snapshot
Enabling secure on-line DNS dynamic update
inferred← citeshttps://doi.org/10.1109/acsac.2001.991524openalex-snapshot
A JCA-based implementation framework for threshold cryptography
inferred← citeshttps://doi.org/10.1109/discex.2000.824963openalex-snapshot
Building intrusion tolerant applications
inferred← citeshttps://doi.org/10.1109/iita.2008.87openalex-snapshot
Threshold Cryptosystem Based Fair Off-Line E-cash
inferred← citeshttps://doi.org/10.1109/iske.2008.4731129openalex-snapshot
Key management scheme based on (t, n) threshold cryptosystem
inferred← citeshttps://doi.org/10.21236/ada387165openalex-snapshot
Building Intrusion Tolerant Applications
inferred← citeshttps://doi.org/10.2478/popets-2022-0055openalex-snapshot
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.46298/jgcc.2023.14.2.10150openalex-snapshot
Multi-recipient and threshold encryption based on hidden multipliers
inferred← citeshttps://doi.org/10.48550/arxiv.1904.00880openalex-snapshot
An Approach to Identity Management in Clouds without Trusted Third Parties
inferred← citeshttps://doi.org/10.6633/ijns.200811.7(3).11openalex-snapshot
Multiplicative Forward-Secure Threshold Signature Scheme
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.