Sharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode
author
Abstract:
In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcipher feedback mode (CFB), which are easier than Chien's scheme in the secret reconstruction andrequire fewer number of public values and storages than Chien's scheme. Also our schemes don'tneed any one-way function and any simultaneous equations.
similar resources
sharing several secrets based on lagrange's interpolation formula and cipher feedback mode
in a multi-secret sharing scheme, several secret values are distributed among a set of n participants.in 2000 chien et al.'s proposed a (t; n) multi-secret sharing scheme. many storages and publicvalues required in chien's scheme. motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the lagrange interpolation formula for polynomials andcip...
full textAnalysis of the Statistical Cipher Feedback Mode of Block Ciphers
In this paper, we examine a recently proposed mode of operation for block ciphers which we refer to as statistical cipher feedback (SCFB) mode. SCFB mode configures the block cipher as a keystream generator for use in a stream cipher such that it has the property of statistical self-synchronization, thereby allowing the stream cipher to recover from bit slips in the communication channel. Stati...
full textIntegrity-Aware Parallelizable Cipher Feedback Mode for Real-time Cryptography
Conventional Cipher Feedback Mode (CFB) can allow the transmission unit to be shorter than the block-cipher length. Eventually, it causes no delay and even any message expansion unlike the ECB and CBC mode of operation where encryption cannot begin unless and until a complete block of full-length (say 64 bits) plain-text data is available. However, because of stalling during the block encryptio...
full textSharing one secret vs. sharing many secrets
A secret sharing scheme is a method for distributing a secret among several parties in such a way that only quali.ed subsets of the parties can reconstruct it and unquali.ed subsets receive no information about the secret. A multi-secret sharing scheme is the natural extension of a secret sharing scheme to the case in which many secrets need to be shared, each with respect to possibly di2erent ...
full textStructures for Interpolation, Decimation, and Nonuniform Sampling Based on Newton’s Interpolation Formula
The variable fractional-delay (FD) filter structure by Tassart and Depalle performs Lagrange interpolation in an efficient way. We point out that this structure directly corresponds to Newton’s interpolation (backward difference) formula, hence we prefer to refer to it as the Newton FD filter. This structure does not function correctly when the fractional delay is made time-variant, e.g., in sa...
full textGruppen secret sharing, or, how to share several secrets if you must?
Each member of an n-person team has a secret, say a password. The k out of n gruppen secret sharing requires that any group of k members should be able to recover the secrets of the other n−k members, while any group of k−1 or less members should have no information on the secret of other team member even if other secrets leak out. We prove that when all secrets are chosen independently and hav...
full textMy Resources
Journal title
volume 5 issue 2
pages 60- 66
publication date 2014-07-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023