Match!

Multi-threshold signature

Published on Apr 1, 2018in Journal of telecommunications and information technology
· DOI :10.26636/jtit.2018.123117
Bartosz Nakielski2
Estimated H-index: 2
,
Jacek Pomykała2
Estimated H-index: 2
(University of Warsaw),
Janusz Andrzej Pomykała1
Estimated H-index: 1
Cite
  • References (8)
  • Citations (4)
Cite
References8
Newest
Published on Dec 1, 2007
Jacek Pomyka5
Estimated H-index: 5
(University of Warsaw),
Tomasz Warchol1
Estimated H-index: 1
In this paper we present the efficient solution for the dynamical groups with the variable threshold bound. In fact we consider the more general situation, when there is a family of dynamical groups instead of one group. We were able to handle this more general situation by joining the secret sharing idea together with the certification system device that enabled the system to distinguish the members of distinct groups of the family. The system proposed here is provably secure. The security is p...
Published on Jan 1, 2001
Silvio Micali68
Estimated H-index: 68
,
Kazuo Ohta27
Estimated H-index: 27
,
Leonid Reyzin30
Estimated H-index: 30
Formal models and security proofs are especially important for multisignatures: in contrast to threshold signatures, no precise denitions were ever provided for such schemes, and some proposals were subsequently broken. In this paper, we formalize and implement a variant of multi-signature schemes, Accountable-Subgroup Multisignatures (ASM). In essence, ASM schemes enable any subgroup,S, of a given group,G, of potential signers, to sign eciently a message M so that the signature provably reveals...
Published on Jul 1, 1989 in CRYPTO (International Cryptology Conference)
Yvo Desmedt38
Estimated H-index: 38
,
Yair Frankel20
Estimated H-index: 20
In a society oriented cryptography it is better to have a public key for the company (organization) than having one for each individual employee [Des88]. Certainly in emergency situations, power is shared in many organizations. Solutions to this problem were presented [Des88], based on [GMW87], but are completely impractical and interactive. In this paper practical non-interactive public key systems are proposed which allow the reuse of the shared secret key since the key is not revealed either ...
Published on Nov 1, 1988in ACM Transactions on Computer Systems1.38
Tatsuaki Okamoto1
Estimated H-index: 1
A new digital multisignature scheme using bijective public-key cryptosystems that overcomes the problems of previous signature schemes used for multisignatures is proposed. The principal features of this scheme are (1) the length of a multisignature message is nearly equivalent to that for a singlesignature message; (2) by using a one-way hash function, multisignature generation and verification are processed in an efficient manner; (3) the order of signing is not restricted; and (4) this scheme...
Published on Nov 1, 1979in Communications of The ACM5.41
A. Shamm71
Estimated H-index: 71
(MIT: Massachusetts Institute of Technology)
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D . This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Published on Feb 1, 1978in Communications of The ACM5.41
Ronald L. Rivest75
Estimated H-index: 75
(MIT: Massachusetts Institute of Technology),
A. Shamm71
Estimated H-index: 71
(MIT: Massachusetts Institute of Technology),
Leonard M. Adleman37
Estimated H-index: 37
(MIT: Massachusetts Institute of Technology)
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privatel...
Cited By4
Newest
In energy detection for cognitive radio spectrum sensing, the noise variance is usually assumed given, by which a threshold is set to guarantee a desired constant false alarm rate (CFAR) or a constant detection rate (CDR). However, in practical situations, the exact information of noise variance is generally unavailable to a certain extent due to the fact that the total noise consists of time-varying thermal noise, receiver noise, and environmental noise, etc. Hence, setting the thresholds by us...
Published on May 1, 2018
Mateusz Kustra1
Estimated H-index: 1
,
Krzysztof Kosmowski1
Estimated H-index: 1
,
Marek Suchanski2
Estimated H-index: 2
The article presents the results of the efficiency analysis of the hybrid sensing technique for the OFDM (Orthogonal Frequency Division Multiplexing) signal used in the radiostation R-450C produced by TRANSBIT company. To conduct the research a hybrid detector was used, combining a fast detection method with a method ensuring high accuracy. Thanks to such a combination an increase in detection speed was obtained while maintaining the required reliability and sensitivity. The article also present...
Bartosz Nakielski2
Estimated H-index: 2
,
Jacek Pomyka5
Estimated H-index: 5
(University of Warsaw)
In the paper we present a simple threshold decryption system based on the RSA cryptosystem. Our model avoids the application of the Shamir secret sharing protocol and is based only on the Chinese reminder theorem. The flexibility in the threshold level is attained due to the suitable preparation of the input data. The second part of the article describes a modification of the basic model, which admits the sender’s impact on the choice of the real receiver’s group. Keywords—CRT, RSA, threshold de...
Published on Jan 1, 2008in Biuletyn Wojskowej Akademii Technicznej
Bartosz Nakielski2
Estimated H-index: 2
,
Jacek Pomyka5
Estimated H-index: 5
(University of Warsaw),
Janusz Andrzej Pomykała1
Estimated H-index: 1
Published on Jan 1, 2008
J. Pomykała (PAN: Polish Academy of Sciences), B. Źrałek (PAN: Polish Academy of Sciences)