Results 1 - 10 of 3,521

Using Trusted Execution Environments in Two-factor Authentication: comparing approaches

by Van Rijswijk-deij, Erik Poll
"... Abstract: Classic two-factor authentication has been around for a long time and has enjoyed success in certain markets (such as the corporate and the banking environment). A reason for this success are the stronger security properties, particularly where user interaction is concerned. These properti ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract: Classic two-factor authentication has been around for a long time and has enjoyed success in certain markets (such as the corporate and the banking environment). A reason for this success are the stronger security properties, particularly where user interaction is concerned

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

by Peter W. Shor - SIAM J. on Computing , 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract - Cited by 1277 (4 self) - Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

by Peter W. Shor , 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in com-putation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract - Cited by 1111 (5 self) - Add to MetaCart
of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. (We thus give the first examples of quantum cryptanulysis.)

MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS

by Yehuda Koren, Robert Bell, Chris Volinsky - IEEE COMPUTER , 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract - Cited by 593 (4 self) - Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern

Bilattices and the Semantics of Logic Programming

by Melvin Fitting , 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on prob ..."
Abstract - Cited by 446 (13 self) - Add to MetaCart
those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap's logic, the logic given by the simplest bilattice. 1 Introduction Often useful information is spread over a

Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks

by Steven M. Bellovin, Michael Merritt - IEEE SYMPOSIUM ON RESEARCH IN SECURITY AND PRIVACY , 1992
"... Classical cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. We introduce a novel combination of asymmetric (public-key) and symmetric (secret-key) cryptography that allow two parties sharing a common password to exchange confidential and authenti ..."
Abstract - Cited by 436 (5 self) - Add to MetaCart
Classical cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. We introduce a novel combination of asymmetric (public-key) and symmetric (secret-key) cryptography that allow two parties sharing a common password to exchange confidential

On the Usability of Two-Factor Authentication

by Ding Wang, Ping Wang
"... Abstract. Smart-card-based password authentication, known as two-factor authentication, is one of the most widely used security mechanisms to validate the legitimacy of a remote client, who must hold a valid smart card and the correct password in order to successfully login the server. So far the re ..."
Abstract - Add to MetaCart
Abstract. Smart-card-based password authentication, known as two-factor authentication, is one of the most widely used security mechanisms to validate the legitimacy of a remote client, who must hold a valid smart card and the correct password in order to successfully login the server. So far

Analyzing two-factor authentication devices

by Anders Moen Hagalisletto
"... It is expected that mobile phones will be used in various e-commerce applications, since it is handy and frequently used. Another important aspect is that mobile phones approach computers both with respect to programmability and capacity. One example of a cutting edge application is a generic auth ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
authentication mechanism invented by a new Norwegian startup company: a mobile terminal is used as a password calculator that could potentially be used towards any Internet service provider. Yet, security protocols in general and authentication protocols in particular are vulnerable to attacks: The current

Front End Factor Analysis for Speaker Verification

by Najim Dehak, Patrick J. Kenny, Réda Dehak, Pierre Dumouchel, Pierre Ouellet - IEEE Transactions on Audio, Speech and Language Processing , 2010
"... Abstract—This paper presents an extension of our previous work which proposes a new speaker representation for speaker verification. In this modeling, a new low-dimensional speaker- and channel-dependent space is defined using a simple factor analysis. This space is named the total variability space ..."
Abstract - Cited by 315 (22 self) - Add to MetaCart
for both-gender trials on the 10 s-10 s condition compared to the classical joint factor analysis scoring. Index Terms—Cosine distance scoring, joint factor analysis (JFA), support vector machines (SVMs), total variability space. I.

A Survey and Comparison of Peer-to-Peer Overlay Network Schemes

by Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma, Steven Lim - IEEE COMMUNICATIONS SURVEYS AND TUTORIALS , 2005
"... Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they ..."
Abstract - Cited by 302 (1 self) - Add to MetaCart
Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because
Results 1 - 10 of 3,521