3,325 research outputs found
Simplification of Controlled PUF primitives
Get PDFPhysical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge. Their use has been proposed for
authentication tokens and anti-counterfeiting. A Controlled PUF (CPUF) consists of a PUF and a control layer that restricts a user's access to the PUF input and output. CPUFs can be used for secure key storage, authentication, certified execution of programs, and certified measurements. In this paper we modify a number of protocols involving CPUFs in order to improve their security. Our modifications mainly consist of encryption of a larger portion of the message traffic, and additional restrictions on the CPUF accessibility. We simplify the description of CPUF protocols by using flowchart notation. Furthermore we explicitly show how the helper data for the PUFs is handled
An efficient fuzzy extractor for limited noise
Get PDFA fuzzy extractor is a security primitive that allows
for reproducible extraction of an almost uniform key from a
non-uniform noisy source. We analyze a fuzzy extractor scheme that
uses universal hash functions for both information reconciliation and
privacy amplification. This is a useful scheme when the number of
error patterns likely to occur is limited, regardless of the error
probabilities. We derive a sharp bound on the uniformity of the
extracted key, making use of the concatenation property of universal
hash functions and a recent tight formulation of the leftover hash
lemma
Measuring privacy leakage in term of Shannon entropy
Get PDFDifferential privacy is a privacy scheme in which a database is modified such that each users personal data are protected without affecting significantly the characteristics of the whole data. Example of such mechanism is Randomized Aggregatable Privacy-Preserving Ordinal Response (RAPPOR). Later it is found that the interpretations of privacy, accuracy and utility parameters in differential privacy are not totally clear. Therefore in this article an alternative definition of privacy aspect are proposed, where they are measured in term of Shannon entropy. Here Shannon entropy can be interpreted as number of binary questions an aggregator needs to ask in order to learn information from a modified database. Then privacy leakage of a differentially private mechanism is defined as mutual information between original distribution of an attribute in a database and its modified version. Furthermore, some simulations using the MATLAB software for special cases in RAPPOR are also presented to show that this alternative definition does make sense
Letter of concern from Boris Drasin, President of the Jersey Homesteads Industrial Cooperative Association
No full textJersey Homesteads (later renamed the Borough of Roosevelt) was established in the 1930s as an agro-industrial cooperative community. It was established specifically for urban Jewish garment workers, many of whome had emigrated from Europe. In this letter, Boris Drasin, a community leader who was the President of the Jersey Homesteads Industrial Cooperative Association, expresses his concerns to their management corporation (Consumers Wholesale Clothiers, Inc.) about how financial losses will impact the lives of Roosevelt's residents, three-fourths of whom depended on the garment factory for their livelihoods. He makes suggestions as to how the situation might be improved
Widespread Expression of BORIS/CTCFL in Normal and Cancer Cells
No full textThis is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited
Boris Smolar papers, undated, 1913-1985.
No full textThis collection contains materials pertaining to the life and career of Boris Smolar, a journalist and editor-in-chief of the Jewish Telegraphic Agency and an author of children's books.Gift of Leivy Smolar
Asymptotically false-positive-maximizing attack on non-binary Tardos codes
No full textWe use a method recently introduced by Simone and Skoric to study accusation probabilities for non-binary Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to include a broad class of collusion attack strategies. We analytically derive properties of a special attack that asymptotically maximizes false accusation probabilities. We present numerical results on sufficient code lengths for this attack, and explain the abrupt transitions that occur in these results
Introduction
No full textOver the past decades a large range of security primitives has been developed to protect digital information. These primitives have solved many traditional security problems and achieved a high level of sophistication. Their security properties are well understood. An intrinsic property, vital for secure operation, is that they are extremely sensitive to small variations in their input.</p
A communication-theoretical view on secret extraction
Get PDFThe recent achievements in enhanced throughput, efficiency, and reliability of wireless communication systems can largely be contributed to the availability of a versatile mathematical framework for the behavior and performance of digital transmission schemes. The key foundation was Shannon's 1948 paper [251] that introduced the notion of capacity. The term capacity is defined as the maximum achievable rate of information exchange, where the maximization is conducted over all possible choices of transmission and detection techniques. The existence of a fundamental limit has acted as an irresistable target for ambitious engineers. However, it was only until the 1990s that the signal processing capabilities allowed a true exploitation of these insights and the throughput of practical systems closely reached the capacity limits. Another important condition was met earlier: the availability of sufficiently realistic statistical models for signals, the noise, and the channel
Fingerprint template protection using minutia-pair spectral representations
No full textStorage of biometric data requires some form of template protection in order to preserve the privacy of people enrolled in a biometric database. One approach is to use a Helper Data System. Here it is necessary to transform the raw biometric measurement into a fixed-length representation. In this paper we extend the spectral function approach of Stanko and Skoric [WIFS2017], which provides such a fixed-length representation for fingerprints. First, we introduce a new spectral function that captures different information from the minutia orientations. It is complementary to the original spectral function, and we use both of them to extract information from a fingerprint image. Second, we construct a helper data system consisting of zero-leakage quantisation followed by the Code Offset Method. We show empirical data which demonstrates that applying our helper data system causes only a small performance penalty compared to fingerprint authentication based on the unprotected spectral functions
- …
