A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key...A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.展开更多
Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedba...Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedback load that the sum feedback rate can be a bottleneck for the communication system,especially when the number of users is large.In this paper,a new scheme using pseudo-random beamforming vectors and angle based threshold in the feedback process is proposed.In the proposed scheme,both the base-station and the users have no need to store a codebook.In each access procedure,the base-station generates a pseudo-random beamforming vector,and each user calculates the angle between the beamforming vectors and its channel state information(CSI) vector.If the angle is less than a predefined angle-threshold,the user feeds back its channel quality indicators(CQI),otherwise it keep silence.Compared with the codebook based scheme,the proposed scheme can largely reduce the sum feedback rate with negligible throughput loss.In particular,when the system has a constraint on the total sum feedback rate in uplink channel,the proposed scheme can increase the system throughput significantly.展开更多
In this paper, we present the model of threshold schemes with weights as a natural generalization of Shamir's threshold scheme and show how to apply the model to construct secret sharing schemes by two examples.
This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a...This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such that any subset with more than t members can jointly reconstruct a secret and reveal the identity of the signer. Any active adversary cannot do this even if he can corrupt up to t - 1 group members.展开更多
In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised...In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.展开更多
文摘A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.
文摘Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedback load that the sum feedback rate can be a bottleneck for the communication system,especially when the number of users is large.In this paper,a new scheme using pseudo-random beamforming vectors and angle based threshold in the feedback process is proposed.In the proposed scheme,both the base-station and the users have no need to store a codebook.In each access procedure,the base-station generates a pseudo-random beamforming vector,and each user calculates the angle between the beamforming vectors and its channel state information(CSI) vector.If the angle is less than a predefined angle-threshold,the user feeds back its channel quality indicators(CQI),otherwise it keep silence.Compared with the codebook based scheme,the proposed scheme can largely reduce the sum feedback rate with negligible throughput loss.In particular,when the system has a constraint on the total sum feedback rate in uplink channel,the proposed scheme can increase the system throughput significantly.
基金This research is supported by the National Natural Science Foundation of China (Nos. 6008302, 90304012).
文摘In this paper, we present the model of threshold schemes with weights as a natural generalization of Shamir's threshold scheme and show how to apply the model to construct secret sharing schemes by two examples.
基金the National Natural Science Foundation of China(Nos.60703031,60703004,60673076,60672068)
文摘This paper presents a concrete democratic group signature scheme which holds （t, n）-threshold traceability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such that any subset with more than t members can jointly reconstruct a secret and reveal the identity of the signer. Any active adversary cannot do this even if he can corrupt up to t - 1 group members.
基金Supported in part by an International Macquarie University Research Excellence Scholarship(i MQRES),Australian Research Council Grant DP0987734also supported by the National Basic Research Program of China(973 Program)under Grant No.2010CB923200+2 种基金the National Natural Science Foundation of China under No.61377067Fund of State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications,China,National Natural Science Foundation of China under Grant Nos.61202362,61262057,61472433China Postdoctora Science Foundation under Grant No.2013M542560
文摘In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.
