Pith. sign in

REVIEW 1 cited by

A secret sharing scheme using groups

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1009.0026 v1 pith:HPV7Q3ZW submitted 2010-08-31 cs.CR math.GR

Dimitrios Panagopoulos This is my paper · ORCID
classification cs.CRmath.GR
keywords schemegroupssecretsharingarticlecategoriesconcludesdiscussed
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper a secret sharing scheme based on the word problem in groups is introduced. The security of the scheme and possible variations are discussed in section 2. The article concludes with the suggestion of two categories of platform groups for the implementation of the scheme.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Resource Reduction in Multiparty Quantum Secret Sharing of both Classical and Quantum Information under Noisy Scenario

    quant-ph 2025-04 reject novelty 4.0 of 10

    For single-qubit quantum secret sharing protocols, encoding each qubit three times and taking a majority vote corrects bit-flip, phase-flip, and amplitude-damping noise with only three physical qubits per logical qubit.

Pith tools