Results 11 to 20 of about 567,858 (283)
A survey and refinement of repairable threshold schemes
Journal of Mathematical Cryptology, 2018 We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers.
Laing Thalia M., Stinson Douglas R.
doaj +2 more sources
A Combinatorial Approach to Threshold Schemes [PDF]
SIAM Journal on Discrete Mathematics, 1988 We investigate the combinatorial properties of threshold schemes. Informally, a (t,w)-threshold scheme is a way of distributing partial information (shadows) to w participants, so that any t of them can easily calculate a key, but no subset of fewer than t participants can determine the key.
Stinson, D. R., Vanstone, S. A.
exaly +2 more sources
Threshold cryptography based on Asmuth–Bloom secret sharing [PDF]
Information Sciences, 2007 Cataloged from PDF version of article.In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosysterns.
Kaya, K., Selcuk, A. A.
core +3 more sources
Threshold Signature Schemes Application
Безопасность информационных технологий, 2015 This work is devoted to an investigation of threshold signature schemes. The systematization of the threshold signature schemes was done, cryptographic constructions based on interpolation Lagrange polynomial, elliptic curves and bilinear pairings were ...
Anastasiya Victorovna Beresneva +1 more
doaj +1 more source
Efficient Threshold Signature Scheme [PDF]
International Journal of Advanced Computer Science and Applications, 2012 In this paper, we introduce a new threshold signature RSA-typed scheme. The proposed scheme has the characteristics of un-forgeable and robustness in random oracle model. Also, signature generation and verification is entirely non-interactive. In addition, the length of the entity signature participate is restricted by a steady times of the length of ...
Sattar J, Mohammad AL-Fayoumi
openaire +2 more sources
Linear Threshold Multisecret Sharing Schemes [PDF]
Information Processing Letters, 2010 In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a differ- ent associated access structure. We consider here unconditionally secure schemes with multithreshold access structures.
Farras Ventura, Oriol +3 more
openaire +3 more sources
Combinatorial repairability for threshold schemes [PDF]
Designs, Codes and Cryptography, 2017 In this paper, we consider methods whereby a subset of players in a $(k,n)$-threshold scheme can "repair" another player's share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme.
Douglas R. Stinson, Ruizhong Wei
openaire +2 more sources
Brakke’s inequality for the thresholding scheme [PDF]
Calculus of Variations and Partial Differential Equations, 2020 AbstractWe continue our analysis of the thresholding scheme from the variational viewpoint and prove a conditional convergence result towards Brakke’s notion of mean curvature flow. Our proof is based on a localized version of the minimizing movements interpretation of Esedoğlu and the second author.
Laux, T., Otto, F.
openaire +4 more sources
Dynamic Multi-threshold Metering Schemes [PDF]
, 2001 A metering scheme is a protocol in which an audit agency is able to measure the interaction between clients and servers on the web during a certain number of time frames. Naor and Pinkas [7] considered metering schemes in which any server is able to construct a proof to be sent to the audit agency if and only if it has been visited by at least a number,
BLUNDO, Carlo +3 more
openaire +2 more sources
Threshold Schemes with Disenrollment [PDF]
Proceedings. IEEE International Symposium on Information Theory, 2005 When a shadow of a threshold scheme is publicized, new shadows have to be reconstructed and redistributed in order to maintain the same level of security. In this paper we consider threshold schemes with disenrollment capabilities where the new shadows can be created by broadcasts through a public channel. We establish a lower bound on the size of each
B. Blakley +3 more
openaire +1 more source