Results 211 to 220 of about 241,347 (258)

A Construction for Multisecret Threshold Schemes

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jackson, W.A., Martin, K., O'Keefe, C.
openaire   +3 more sources

New threshold-proxy threshold-signature schemes

Computers & Electrical Engineering, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shin-Jia Hwang, Chiu-Chin Chen
openaire   +1 more source

Analysis of fuzzy thresholding schemes

Pattern Recognition, 2000
Abstract Fuzzy thresholding schemes preserve the structural details embedded in the original gray distribution. In this paper, various fuzzy thresholding schemes are analysed in detail. Thresholding scheme based on fuzzy clustering has been extended to a possibilistic framework.
C. V. Jawahar, Prabir K. Biswas, A. K. Ray   +2 more
openaire   +1 more source

An Optimal Multisecret Threshold Scheme Construction

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Susan G. Barwick, Wen-Ai Jackson
openaire   +2 more sources

A note on the randomness in dynamic threshold schemes

Journal of Computer Security, 1999
In dynamic threshold schemes the dealer is able (after a preprocessing stage) to allow sets of participants of a given cardinality to reconstruct different secrets (in different time instants) by sending them the same broadcast message. In this paper we provide a tight lower bound on the number of random bits needed by the dealer to set up a dynamic ...
BLUNDO, Carlo, MASUCCI, Barbara
openaire   +2 more sources

A Multisecret Sharing Threshold Scheme

2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
A threshold sharing scheme is a system that protects a secret (key) among a group of participants in such a way that it can only be reconstructed from pooled information held by some certain number of these authorized participants. In this paper we extend this problem to one where there are multiple secrets which participants need reconstruct using the
openaire   +1 more source

A Threshold GQ Signature Scheme

2003
We proposed the first threshold GQ signature scheme. The scheme is unforgeable and robust against any adaptive adversary if the base GQ signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a safe prime is hard. Furthermore, our scheme can achieve optimal resilience by some modification.
Cheng-Kang Chu, Li-Shan Liu, Wen-Guey Tzeng   +2 more
openaire   +2 more sources

Families of threshold schemes

Proceedings of 1994 IEEE International Symposium on Information Theory, 2002
The notion of families of ideal threshold schemes (ITS) is introduced, their properties and applications are investigated. We consider secret sharing schemes whose parameters can be adjusted. Our model is a threshold scheme family (TSF) whose threshold scheme parameters can be modified dynamically. Some applications of this model includes schemes which
C. Charnes, J. Pieprzyk, R. Safavi-Naini
openaire   +1 more source

Certificateless Threshold Signature Schemes

2005
We analyze the relationship and subtle difference between the notion of certificateless public key cryptography (CL-PKC) and identity-based schemes without a trusted private key generator (PKG), then propose a certificateless threshold signature scheme based on bilinear pairings.
Lichen Wang, Zhenfu Cao, Xiangxue Li, Haifeng Qian   +3 more
openaire   +1 more source

Threshold Schemes from Isogeny Assumptions

2020
We initiate the study of threshold schemes based on the Hard Homogeneous Spaces (HHS) framework of Couveignes. Quantum-resistant HHS based on supersingular isogeny graphs have recently become usable thanks to the record class group precomputation performed for the signature scheme CSI-FiSh.
Luca De Feo, Michael Meyer 0001
openaire   +2 more sources