The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability...
From von Solms and Naccache's standpoint, constructing a practical and secure e-money system implies a proper regulation of its privacy level. Furthermore, when the system benefits from a widely connected communication network, tuning precisely this control for achieving efficiency without endangering security is a hard task. In order to solve this specific problem, we propose an e-cash scheme based...
In this paper, we introduce a new electronic money methodology: sub-contracting the blinding to a trustee and using an Identity-based piece of information to achieve provable privacy and security. This variation on the Brickel, Gemmel and Kravitz paradigm [2] offers protection against various attacks minimizing user's computational requirement. Furthermore, our scheme offers various complexity/privacy...
Montgomery's algorithm [8], hereafter denoted Mn(·,·), is a process for computing Mn(A,B)=ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is obtained by Mn(Mn(A,B),N−2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(·,·) will replace directly each modular multiplication...
Physical Unclonable Functions (PUFs) allow a silicon device to be authenticated based on its manufacturing variations using challenge/response evaluations. Popular realizations use linear additive functions as building blocks. Security is scaled up using non-linear mixing (e.g., adding XORs). Because the responses are physically derived and thus noisy, the resulting explosion in noise impacts both...
We describe a PUF design with integrated error correction that is robust to various layout implementations and achieves excellent and consistent results in each of the following four areas: Randomness, Uniqueness, Bias and Stability. 133 PUF devices in 0.13 μm technology encompassing seven circuit layout implementations were tested. The PUF-based key generation design achieved less than 0.58 ppm failure...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.