First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials

Gerasimos C. Meletiou (), Dimitrios S. Triantafyllou () and Michael N. Vrahatis ()
Additional contact information
Gerasimos C. Meletiou: University of Ioannina
Dimitrios S. Triantafyllou: Hellenic Military Academy
Michael N. Vrahatis: University of Patras

A chapter in Computational Mathematics and Variational Analysis, 2020, pp 247-259 from Springer

Abstract: Abstract A ramp secret sharing scheme through greatest common divisor of polynomials is presented. Verification and shelf correcting protocols are also developed. The proposed approach can be implemented in a hybrid way using numerical and symbolical arithmetic. Numerical examples illustrating the proposed sharing schemes are also given.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-44625-3_14

Ordering information: This item can be ordered from
http://www.springer.com/9783030446253

DOI: 10.1007/978-3-030-44625-3_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().