A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
New results for traitor tracing schemes
[article]
2016
arXiv
pre-print
Preserved Fulltext
Secondly, we derive a new upper bound for parent-identifying codes, which is superior than all previously known bounds. ...
It is the first meaningful upper bound for 3-traceability codes and our result supports a conjecture of Blackburn et al. posed in 2010. ...
In Section 3, we derive a new upper bound for parent-identifying codes. And in Section 4, we present an upper bound for 3-traceability codes. Section 5 is about some concluding remarks.
II. ...
arXiv:1610.07719v1
fatcat:rxmw7gicbrbkfmcqgxzie34wle
Bounds on Traceability Schemes
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A new upper bound is also given for parent-identifying set systems. ...
Based on this interesting discovery, we derive new upper bounds for traceability schemes. ...
New relationship between TS and CFF, and new upper bounds for t-TS are provided in Section IV. ...
arXiv:1609.08336v1
fatcat:7mabuhaforhddpaetn5gph4e7y
The W-SEPT Project: Towards Semantic-Aware WCET Estimation
2017
Worst-Case Execution Time Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The W-SEPT project, for "WCET, Semantics, Precision and Traceability", has been carried out to study and exploit the influence of program semantics on the WCET estimation. ...
Providing an upper bound of the worst-case execution time (WCET) of such tasks at design time is necessary to guarantee the correctness of the system. ...
Therefore, for a given program, the simulation provides a guaranteed lower bound, M W CET , that forms with the guaranteed upper bound E W CET an uncertainty interval. ...
doi:10.4230/oasics.wcet.2017.9
dblp:conf/wcet/MaizaRPBCCCCHJL17
fatcat:qoobg54nkrb7zhauujzgws7xlu
Generalized hashing and parent-identifying codes
2003
Journal of combinatorial theory. Series A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The obtained lower bound on the rate of ðt; uÞ-hashing families is applied to get a new lower bound on the rate of t-parent identifying codes. r ...
In this paper, we provide lower and upper bounds on the best possible rate of ðt; uÞ-hashing families for fixed t; u and growing n: We also describe an explicit construction of ðt; uÞ-hashing families. ...
New bounds for ðt; uÞ-hashing In this section, we present new bounds on the rate of ðt; uÞ-hashing families. ...
doi:10.1016/j.jcta.2003.08.001
fatcat:eme33h7q65f6zltevi46dmki6y
Efficient Traitor Tracing Algorithms Using List Decoding
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. ...
Although much work has focused on constructing traceability schemes, the complexity of the tracing algorithm has received little attention. ...
The authors thank Gui-Leng Feng, Tom Høholdt, Ralf Kötter, and Madhu Sudan for useful conversations. ...
doi:10.1007/3-540-45682-1_11
fatcat:nepsczcfpzctdd57r4stwlndpm
Performance Study on Multimedia Fingerprinting Employing Traceability Codes
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Many fingerprinting codes are proposed with tracing capability and collusion resistance, such as Traceability (TA) codes and Identifiable Parent Property (IPP) codes. ...
Our results show that TA codes generally offer better collusion resistance than IPP codes, and a TA code with a larger alphabet size and a longer code length is preferred. ...
We collectively call these codes traceability codes, which include Identifiable Parent Property (IPP) codes and Traceability (TA) codes 1 [5] - [9] . ...
doi:10.1007/11551492_7
fatcat:4d4njs45onfnjm5y6ycww4rrx4
Compilation of a panel of informative single nucleotide polymorphisms for bovine identification in the Northern Irish cattle population
2010
BMC Genetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Results: 6 SNPs exhibiting a minor allele frequency of less than 0.2 in more than 3 of the breed panels were excluded. 2 Further SNPs were found to reside in coding areas of the cattle genome and were ...
Minimal probabilities of uniquely identifying individual animals from each of the breeds were obtained and were observed to be superior to those conferred by the industry standard STR assay. ...
Subsequent Haploview analysis of these D' values and their confidence bounds revealed that they lie outside the default D' confidence interval (upper bound 0.98; lower bound 0.70) defined by Gabriel et ...
doi:10.1186/1471-2156-11-5
pmid:20100323
pmcid:PMC2826282
fatcat:f3lilml4g5c3zccw4bm7juyema
Applications of list decoding to tracing traitors
2003
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Algebraic geometry code, identifiable parent property, list decoding, traceability code, traitor tracing, Reed-Solomon code. A. Silverberg is with the ...
We compare the TA and IPP (identifiable parent property) traitor tracing algorithms, and give evidence that when using an algebraic structure, the ability to trace traitors with the IPP algorithm implies ...
Codes with the identifiable parent property (IPP) are another type of traceability code. ...
doi:10.1109/tit.2003.810630
fatcat:p7zwver565hifban5ey7e247vi
Two-Level Fingerprinting Codes: Non-Trivial Constructions
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes, to other types of fingerprinting codes, namely identifiable ...
parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. ...
(iii) C has the t-identifiable parent property (or is t-IPP) if for all x ∈ desc t (C), it holds that X⊆C:|X|≤t x∈desc(X) X = ∅. ...
arXiv:1108.6197v2
fatcat:43yoe6r5brcr5alfia4wqlhveu
Timing analysis enhancement for synchronous program
2013
Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In real-time systems, an upper-bound on the execution time is mandatory to guarantee all timing constraints: a bound on the Worst-Case Execution Time (WCET). ...
Thus, a large part of semantic information, known at the design level, is lost due to the compilation scheme (typically organized in two stages, from high-level model to C, and then binary code). ...
To guarantee that these constraints are respected, a bound on the Worst-Case Execution Time is necessary. Static timing analyses aim at estimating this upper-bound on the WCET. ...
doi:10.1145/2516821.2516841
dblp:conf/rtns/RaymondMPC13
fatcat:ab4hras6zzfanpbt6pk3jsf2de
Improving WCET Evaluation using Linear Relation Analysis
2017
Leibniz Transactions on Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For this purpose, we add auxiliary variables (counters) to the program to trace its execution paths. ...
We use existing tools - a WCET evaluator and a linear relation analyzer - to build and experiment a prototype implementation of this idea. ...
Flow facts are found in 347 cases, and at least one fact is new for 268 ones; finally, new facts lead to a WCET improvement for 76 cases. ...
doi:10.4230/lites-v006-i001-a002
dblp:journals/lites/RaymondMPJHCAB19
fatcat:ay5jjbthkfhedngdftpfqo5tty
Digital fingerprinting codes: problem statements, constructions, identification of traitors
2003
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
or identify one traitor with probability 1. ...
Each user is assigned a fingerprint which is a word in a fingerprinting code of size (the total number of users) and length . ...
number of codes of size is bounded above by , which is also an upper bound on the number of keys in this formula. ...
doi:10.1109/tit.2003.809570
fatcat:6sklxm2gv5fotps2ky6kb2c65m
Improved Lower Bounds for Secure Codes and Related Structures
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2108.07987v1 fatcat:4vht6wilirgrzbx2k324ohpqi4
Finally, we give a general method to derive new lower bounds for strongly t-separable matrices and t-cancellative set families for t≥ 3. ...
First, we give some improved lower bounds for the rates of 2-frameproof codes and 2-separable codes for slightly large alphabet size. ...
Various anti-collusion codes have been introduced to resist collusion attacks, such as traceability codes, frameproof codes, parent-identifying codes, separable codes, etc. ...
arXiv:2108.07987v2
fatcat:2ygregzmybhq7c3qkc2pme7rha
Robust Parent-Identifying Codes and Combinatorial Arrays
2013
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A code C = {x 1 , . . . , x M } is said to have the t-IPP property if for any n-word y that is a descendant of at most t parents belonging to the code it is possible to identify at least one of them. ...
We show existence of robust t-IPP codes for all t ≤ q − 1 and some positive proportion of such coordinates. ...
IPP AND FINGERPRINTING CODES 1-A. Introduction. Codes with the identifiable parent property (IPP codes) were introduced by Hollmann et al. [23] . ...
doi:10.1109/tit.2012.2220522
fatcat:dk5j5caeobeenaovsle42hpp34
A Semi-Automated Approach for the Co-Refinement of Requirements and Architecture Models
2017
2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
code generation. ...
The approach has been prototyped for AADL models refined with the RAMSES tool and for model transformations implemented as Story Diagrams. ...
Two types of decomposition are allowed, where in the first case all child requirements of a parent requirement must be verified for the parent to be verified (AND), and for the second case several distinct ...
doi:10.1109/rew.2017.52
dblp:conf/re/BlouinBSGDBTN17
fatcat:uunbzzw7ejc2nlfjh5d2zrxcjy
« Previous
Showing results 1 — 15 out of 4,178 results