Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
type: Item
instance of: scholarly article
title: Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
zbMATH Open document ID: 1321.94100
author: Mihai Barzu
author: Ferucio Laurenţiu Ţiplea
author: Constantin Cătălin Drăgan
published in: Information Sciences
publication date: 2015-09-23T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6484701
zbMATH Keywords: secret-sharing scheme
zbMATH Keywords: Chinese remainder theorem
zbMATH Keywords: entropy
zbMATH Keywords: (asymptotic) perfectness
zbMATH Keywords: (asymptotic) idealness
zbMATH Keywords: perfect zero-knowledge
MaRDI profile type: Publication
full work available at URL: j.ins.2013.03.062
OpenAlex ID: W2060876648
cites work: A modular approach to key safeguarding
cites work: The Difference Between Consecutive Primes
cites work: Q4379555
cites work: Chinese remaindering with errors
cites work: Some of the properties of the sequence of powers of prime numbers.
cites work: Q3043938
cites work: Q4870979
cites work: How to share a secret
DOI: 10.1016/J.INS.2013.03.062
Recommended article: Threshold properties of prime power subgroups with application to secure integer comparisons
Recommended article: Q3043938
Recommended article: Expected π-Adic Security Measures of Sequences
Recommended article: On the bit security of cryptographic primitives
Recommended article: Expected $\pi$-Adic Security Measures of Sequences
Recommended article: Threshold Computation and Cryptographic Security
Recommended article: Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
Recommended article: Q4240560
Recommended article: Q4927002
Recommended article: Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
description: scientific article; zbMATH DE number 6484701