Sharing DSS by the Chinese Remainder Theorem

Kaya, Kamer; Selçuk, Ali Aydın

doi:10.1016/j.cam.2013.05.023

Cited by 7 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Threshold secret sharing scheme provides an effective strategy to protect the security and integrity of information and has become an important branch of the Cryptography. At present, secret sharing technology has been widely used in digital images, electronic voting, digital signatures, and other fields. Current research shows that the secret sharing mechanism can guarantee the integrity, reliability, and security of secrets and enhance the robustness of secret data.…”

Section: Nctc Detection Arithmetic Based On Threshold Secret Sharingmentioning

confidence: 99%

A network covert timing channel detection method based on threshold secret sharing

Xie

Chen

Wang

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Network covert timing channel (NCTC) is a kind of covert channel that acquires strong concealment by modifying the interpacket delays of legitimate network traffic and can evade detection by conventional network security mechanisms such as firewalls. Existing detection schemes are not able to detect multiple types of covert channels. Moreover, the robustness of the detection method is low when the network environment changes. Therefore, detecting NCTC is a challenging task. In this paper, an NCTC detection method based on threshold secret sharing is proposed. The new approach utilizes the principle of threshold secret sharing to tolerate the loss or the destruction of partial subsecrets, improves the robustness of the detection method, and solves the problem that the current detection method cannot resist environment changes. Experimental results show that the proposed scheme in this paper has strong robustness to a changing network environment such as when network jitter, packet loss, and packet injection occur in the network transmission process. The approach can detect varieties of NCTCs with a guaranteed true positive rate and greatly improve the versatility and robustness.

show abstract

Section: Nctc Detection Arithmetic Based On Threshold Secret Sharingmentioning

confidence: 99%

A network covert timing channel detection method based on threshold secret sharing

Xie

Chen

Wang

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Asmuth-Bloom secret sharing scheme is probably the first DSS threshold signature scheme based on Chinese remainder theorem. DSS threshold signature scheme is secure which means is noncounterfeiting in adaptive chosen plain-text attack [9]. Also, linear codes have been used for secret sharing.…”

Section: Secret Sharing Schemementioning

confidence: 99%

Polar codes for secret sharing

Moradi¹

2017

Preprint

View full text Add to dashboard Cite

A secret can be an encrypted message or a private key to decrypt the ciphertext. One of the main issues in cryptography is keeping this secret safe. Entrusting secret to one person or saving it in a computer can conclude betrayal of the person or destruction of that device. For solving this issue, secret sharing can be used between some individuals which a coalition of a specific number of them can only get access to the secret. In practical issues, some of the members have more power and by a coalition of fewer of them, they should know about the secret. In a bank, for example, president and deputy can have a union with two members by each other. In this paper, by using Polar codes secret sharing has been studied and a secret sharing scheme based on Polar codes has been introduced. Information needed for any member would be sent by the channel which Polar codes are constructed by it.

show abstract

“…The Shamir's scheme uses polynomial computations and exponentiations to generate the shares and reconstruct the secret, while the CRT-based approach uses modular exponentiations and reductions. The averaged complexity is O(n.log 2 n) for n participants according to Kaya and Selçuk (2014) and Gennaio et al (1996) and the cost becomes very significant when dealing with large secrets such as images, databases and multimedia contents.…”

Section: Introductionmentioning

confidence: 99%

A novel verifiable and unconditionally secure (m, t, n)-threshold multi-secret sharing scheme using overdetermined systems of linear equations over finite Galois fields

Faraoun

2019

IJICS

View full text Add to dashboard Cite

Threshold multi-secrets sharing schemes allow sharing a set of m secrets among n participants, while secrets can be revealed only if t or more participants collude. Although many multi-secret sharing schemes have been proposed, several improvements remain essential in order to cope with actual effectiveness and security requirements, including computational performances and compliance for large-scale data. In this paper, we present a novel multi-secrets (m, t, n)-threshold scheme using overdetermined systems of linear equations defined over finite Galois fields. The scheme provides unconditional security, linear sharing/reconstructing complexities and holds secure verifiability and t-consistence. By considering both secrets and shares as elements over finite Galois fields GF(2 r), optimal and space-efficient representation is ensured compared to recent sharing schemes. In addition, the scheme provides dynamic secrets sharing, forgery/cheating detection and robustness against common attacks, while lower computational overhead is required.

show abstract

Sharing DSS by the Chinese Remainder Theorem

Cited by 7 publications

References 17 publications

A network covert timing channel detection method based on threshold secret sharing

A network covert timing channel detection method based on threshold secret sharing

Polar codes for secret sharing

A novel verifiable and unconditionally secure (m, t, n)-threshold multi-secret sharing scheme using overdetermined systems of linear equations over finite Galois fields

Contact Info

Product

Resources

About