A nonlinear secret sharing scheme

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 1996 China (People's Republic of) Publisher:Springer Berlin Heidelberg

Authors: Renvall, A.; Ding, Cunsheng;

doi: 10.1007/bfb0023287

A nonlinear secret sharing scheme

- Summary
- Metrics

Abstract

In this paper, we have described a nonlinear secret-sharing scheme for n parties such that any set of k−1 or more shares can determine the secret, any set of less than k−1 shares might give information about the secret, but it is computationally hard to extract information about the secret. The scheme is based on quadratic forms and the computation of both the shares and the secret is easy.

Country

China (People's Republic of)

Related Organizations

Hong Kong University of Science and Technology
China (People's Republic of)
University of Turku
Finland
HONG KONG POLYTECHNIC UNIVERSITY
China (People's Republic of)
Hong Kong University of Science and Technology (香港科技大學)
China (People's Republic of)
Hong Kong University of Science and Technology
Hong Kong

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average