On the public citation graph
Threshold Cryptography Based on Asmuth-Bloom Secret Sharing
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.2000.2881openalex-snapshot
Robust Threshold DSS Signatures
inferredcites →https://doi.org/10.1007/11535218_14openalex-snapshot
Private Searching on Streaming Data
inferredcites →https://doi.org/10.1007/3-540-45472-1_7openalex-snapshot
Sharing Decryption in the Context of Voting or Lotteries
inferredcites →https://doi.org/10.1007/3-540-45539-6_15openalex-snapshot
Practical Threshold Signatures
inferredcites →https://doi.org/10.1007/3-540-45664-3_14openalex-snapshot
On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
inferredcites →https://doi.org/10.1007/3-540-45682-1_20openalex-snapshot
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
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-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/bfb0030418openalex-snapshot
Some recent research aspects of threshold cryptography
inferredcites →https://doi.org/10.1007/s10207-004-0041-0openalex-snapshot
Two-party generation of DSA signatures
inferredcites →https://doi.org/10.1016/j.ins.2005.02.010openalex-snapshot
A novel efficient (t,n) threshold proxy signature scheme
inferredcites →https://doi.org/10.1016/j.ins.2006.11.001openalex-snapshot
Optimal resilient threshold GQ signatures
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/tit.1983.1056651openalex-snapshot
A modular approach to key safeguarding
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
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/357830.357847openalex-snapshot
Signature schemes based on the strong RSA assumption
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/383962.384044openalex-snapshot
Practical multi-candidate election system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11042-024-19027-9openalex-snapshot
Novel key-integration to safeguard counting-based secret-sharing from possibilities of cyberattack breaches
inferred← citeshttps://doi.org/10.1016/j.jksuci.2021.09.009openalex-snapshot
Securing matrix counting-based secret-sharing involving crypto steganography
inferred← citeshttps://doi.org/10.1109/apscc.2009.5394143openalex-snapshot
Service token for identity access management
inferred← citeshttps://doi.org/10.1109/erect.2015.7498980openalex-snapshot
A comparative analysis of Secret Sharing Schemes with special reference to e-commerce applications
inferred← citeshttps://doi.org/10.1109/icspcs47537.2019.9008712openalex-snapshot
A Chinese Remainder Theorem Based Perfect Secret Sharing Scheme with Enhanced Secret Range Values Using Tensor Based Operations
inferred← citeshttps://doi.org/10.1109/synasc.2007.20openalex-snapshot
Weighted Threshold RSA Based on the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.30645/ijistech.v5i4.158openalex-snapshot
Utilization of Asmuth-Bloom Algorithm In Data Security Using Secret Sharing Protocol
inferred← citeshttps://doi.org/10.30780/ijtrs.v06.i03.002openalex-snapshot
ALTERNATIVE TO SHAMIR’S SECRET SHARING SCHEME LAGRANGE INTERPOLATION OVER FINITE FIELD
inferred← citeshttps://doi.org/10.3390/sym13050894openalex-snapshot
Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing
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.