Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Stinson, Douglas R.; Trung, Tran van; Wei, Ruizhong

doi:10.1016/s0378-3758(99)00131-7

Cited by 189 publications

(137 citation statements)

References 30 publications

Supporting

Mentioning

133

Contrasting

Unclassified

Order By: Relevance

“…Cover-free families are also studied under the terms disjunct matrices [16], binary superimposed codes [23], and strongly selective families [12]. Stinson et al [37] discusses relations between these structures. We choose the language of cover-free families since they have found multiple applications in cryptography (see [20,26,36] for examples).…”

Section: Nonadaptive Group Testing With Cover-free Familiesmentioning

confidence: 99%

Group Testing and Batch Verification

Zaverucha

Stinson

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new sequential and parallel algorithms for finding invalid signatures based on group testing algorithms. Of the five new algorithms, three show improved performance for many parameter choices, and the performance gains are especially notable when multiple processors are available.

show abstract

Section: Nonadaptive Group Testing With Cover-free Familiesmentioning

confidence: 99%

Group Testing and Batch Verification

Zaverucha

Stinson

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…It was shown by Staddon et al [9] that if the minimum distance of M is ≥ N (1 − 1 ω 2 ), any descendant is traceable to at least one traitor, using M. In general, the strength of a code determines the ease of detecting or tracing a coalition(see e.g., [9,10]). In this paper, we design codes for more general attacks.…”

Section: Strength Of Codes Resisting the Narrow Attackmentioning

confidence: 99%

Traitor Tracing Against Powerful Attacks Using Combinatorial Designs

McNicol

Boztaş

Rao

2006

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

View full text Add to dashboard Cite

This paper addresses the problem of threshold traitor tracing for digital content where, by embedding appropriate digital patterns into the distributed content, it is possible to trace and identify the source of unauthorised redistribution. We use a set of marking assumptions where the adversaries have varying powers change or erase coordinates of the fingerprint where their individual fingerprints differ-and consider the implications. We consider codes derived from combinatorial designs-and develop a method for concatenating the block design code to filter out the false positives and defend against some of the attacks considered.

show abstract

“…KDP with more general size of ∆ have been studied by Stinson et al (see for example [21,22]). We give an example of 1-resilient (9, 12, 2)-KDP.…”

Section: Key Distribution Patterns (Kdps)mentioning

confidence: 99%

Securing Multicast Groups in Ad Hoc Networks

et al. 2004

View full text Add to dashboard Cite

Group communication in multicast environment has been a growing importance in ad hoc networks, and providing secure communication in the group is essential in many ad hoc applications. A common way of securing multicast group is to establish a cryptographic key known only to the group members. To maintain security, the group key must be updated whenever the group membership changes. A group key distribution scheme provides algorithms to establish and maintain the group key.In this paper, we propose a reliable and ubiquitous group key distribution scheme that is suitable for ad hoc networks. The scheme has self-initialisation and self-securing features. The former feature allows a cooperation of an arbitrary number of nodes to initialise the system, and it also allows node admission to be performed in a decentralised fashion. The latter feature allows a group member to determine the group key remotely while maintaining the system security.We also consider a decentralised solution of establishing secure point-to-point communication. The solution allows a new node to establish a secure channel with every existing node if it has pre-existing secure channels with a threshold number of the existing nodes.

show abstract

Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Cited by 189 publications

References 30 publications

Group Testing and Batch Verification

Group Testing and Batch Verification

Traitor Tracing Against Powerful Attacks Using Combinatorial Designs

Securing Multicast Groups in Ad Hoc Networks

Contact Info

Product

Resources

About