Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret ...Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret sharing with entanglement in cavity QED. Based on the theory of secret sharing the QDC process can be more secure.展开更多
Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct...Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.展开更多
Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal...Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.展开更多
Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret shari...Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret sharing. Since its introduction, a number of additional applications have been found. This paper contains a detailed exposition of the known results about algebraic manipulation detection codes as well as some new results.展开更多
For a binary linear code,a new relation between the intersection and(2,2)-separating property is addressed,and a relation between the intersection and the trellis complexity is also given.Using above relations,the aut...For a binary linear code,a new relation between the intersection and(2,2)-separating property is addressed,and a relation between the intersection and the trellis complexity is also given.Using above relations,the authors will apply several classes of binary codes to secret sharing scheme and determine their trellis complexity and separating properties.The authors also present the properties of the intersection of certain kinds of two-weight binary codes.By using the concept of value function,the intersecting properties of general binary codes are described.展开更多
基金National Natural Science Foundation of China under Grant Nos.60678022 and 10674001the Key Program of the Education Department of Anhui Province under Grant Nos.2006KJ070A and 2006KJ057B+1 种基金the Talent Foundation of Anhui UniversityAnhui Key Laboratory of Information Materials and Devices of Anhui University
文摘Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret sharing with entanglement in cavity QED. Based on the theory of secret sharing the QDC process can be more secure.
文摘Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.
文摘Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.
基金supported by the Singapore National Research Foundation(Grant No.NRF-CRP2-2007-03)
文摘Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret sharing. Since its introduction, a number of additional applications have been found. This paper contains a detailed exposition of the known results about algebraic manipulation detection codes as well as some new results.
基金supported by the National Science Foundation of China under Grant Nos.11171366 and 61170257
文摘For a binary linear code,a new relation between the intersection and(2,2)-separating property is addressed,and a relation between the intersection and the trellis complexity is also given.Using above relations,the authors will apply several classes of binary codes to secret sharing scheme and determine their trellis complexity and separating properties.The authors also present the properties of the intersection of certain kinds of two-weight binary codes.By using the concept of value function,the intersecting properties of general binary codes are described.
