On the public citation graph

A CRT‐based verifiable secret sharing scheme secure against unbounded adversaries

https://doi.org/10.1002/sec.1617
0 signed · 41 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.1002/dac.2760openalex-snapshot
A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets
inferredcites →https://doi.org/10.1002/sec.1097openalex-snapshot
A distributed secret share update scheme with public verifiability for ad hoc network
inferredcites →https://doi.org/10.1002/sec.1467openalex-snapshot
Linear ( k , n ) secret sharing scheme with cheating detection
inferredcites →https://doi.org/10.1002/sec.807openalex-snapshot
Verifiable secret sharing based on the Chinese remainder theorem
inferredcites →https://doi.org/10.1006/inco.2000.2881openalex-snapshot
Robust Threshold DSS Signatures
inferredcites →https://doi.org/10.1007/11426639_4openalex-snapshot
Reducing Complexity Assumptions for Statistically-Hiding Commitment
inferredcites →https://doi.org/10.1007/3-540-36178-2_22openalex-snapshot
On Unconditionally Secure Robust Distributed Key Distribution Centers
inferredcites →https://doi.org/10.1007/3-540-39466-4_27openalex-snapshot
How to Share a Secret
inferredcites →https://doi.org/10.1007/3-540-44750-4_27openalex-snapshot
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
inferredcites →https://doi.org/10.1007/3-540-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferredcites →https://doi.org/10.1007/3-540-45539-6_31openalex-snapshot
Efficient Proofs that a Committed Number Lies in an Interval
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-46416-6_47openalex-snapshot
A Threshold Cryptosystem without a Trusted Party
inferredcites →https://doi.org/10.1007/3-540-46877-3_24openalex-snapshot
A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party
inferredcites →https://doi.org/10.1007/978-3-540-77048-0_18openalex-snapshot
Boudot’s Range-Bounded Commitment Scheme Revisited
inferredcites →https://doi.org/10.1007/978-3-540-89754-5_32openalex-snapshot
A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_38openalex-snapshot
Multiparty Computation from Somewhat Homomorphic Encryption
inferredcites →https://doi.org/10.1007/978-3-662-43414-7_18openalex-snapshot
A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
inferredcites →https://doi.org/10.1007/bf02403921openalex-snapshot
Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes
inferredcites →https://doi.org/10.1007/bfb0052225openalex-snapshot
Statistical zero knowledge protocols to prove modular polynomial relations
inferredcites →https://doi.org/10.1007/s00145-013-9172-7openalex-snapshot
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
inferredcites →https://doi.org/10.1016/j.ins.2007.04.008openalex-snapshot
Threshold cryptography based on Asmuth–Bloom secret sharing
inferredcites →https://doi.org/10.1109/icccas.2005.1493367openalex-snapshot
A non-interactive modular verifiable secret sharing scheme
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
inferredcites →https://doi.org/10.1109/sfcs.1987.4openalex-snapshot
A practical scheme for non-interactive verifiable secret sharing
inferredcites →https://doi.org/10.1109/tit.1983.1056651openalex-snapshot
A modular approach to key safeguarding
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.48550/arxiv.2103.04483openalex-snapshot
An Amazing Prime Heuristic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-91356-4_7openalex-snapshot
Randomized Component Based Secure Secret Reconstruction in Insecure Networks
inferred← citeshttps://doi.org/10.1007/s11416-024-00530-4openalex-snapshot
On modular (CRT-based) secret sharing
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.006openalex-snapshot
Homomorphic extensions of CRT-based secret sharing
inferred← citeshttps://doi.org/10.1016/j.jisa.2019.102430openalex-snapshot
A verifiable secret sharing scheme with combiner verification and cheater identification
inferred← citeshttps://doi.org/10.1109/access.2019.2929090openalex-snapshot
An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages
inferred← citeshttps://doi.org/10.1109/access.2019.2946874openalex-snapshot
Key Escrow Protocol Based on a Tripartite Authenticated Key Agreement and Threshold Cryptography
inferred← citeshttps://doi.org/10.1155/2021/1864514openalex-snapshot
Threshold Key Management Scheme for Blockchain-Based Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.20944/preprints202312.1652.v1openalex-snapshot
A Collusion attack prevention (CAP) scheme for securing Mobile Adhoc Network
inferred← citeshttps://doi.org/10.32604/csse.2023.032862openalex-snapshot
A Secure Framework for Blockchain Transactions Protection
inferred← citeshttps://doi.org/10.32604/iasc.2023.030287openalex-snapshot
An Optimal Algorithm for Secure Transactions in Bitcoin Based on Blockchain
inferred← citeshttps://doi.org/10.3390/math8122218openalex-snapshot
Threshold-Based Post-Quantum Secure Verifiable Multi-Secret Sharing for Distributed Storage Blockchain
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.