IBM

About: IBM is a company organization based out in Armonk, New York, United States. It is known for research contribution in the topics: Layer (electronics) & Cache. The organization has 134567 authors who have published 253905 publications receiving 7458795 citations. The organization is also known as: International Business Machines Corporation & Big Blue.

CAPTCHA: using hard AI problems for security

Abstract: We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high success over a captcha can be used to solve an unsolved Artificial Intelligence (AI) problem. We provide several novel constructions of captchas. Since captchas have many applications in practical security, our approach introduces a new class of hard problems that can be exploited for security purposes. Much like research in cryptography has had a positive impact on algorithms for factoring and discrete log, we hope that the use of hard AI problems for security purposes allows us to advance the field of Artificial Intelligence. We introduce two families of AI problems that can be used to construct captchas and we show that solutions to such problems can be used for steganographic communication. captchas based on these AI problem families, then, imply a win-win situation: either the problems remain unsolved and there is a way to differentiate humans from computers, or the problems are solved and there is a way to communicate covertly on some channels.

Thermal fluctuations, quenched disorder, phase transitions, and transport in type-II superconductors.

Abstract: The effects of thermal fluctuations, quenched disorder, and anisotropy on the phases and phase transitions in type-II superconductors are examined, focusing on linear and nonlinear transport properties. In zero magnetic field there are two crossovers upon approaching ${\mathit{T}}_{\mathit{c}}$, first the ``Ginzburg'' crossover from mean-field behavior to the universality class of an uncharged superfluid, and then, much closer to ${\mathit{T}}_{\mathit{c}}$ for strongly type-II systems, a crossover to the universality class of a charged superfluid. The primary focus of this paper is on the behavior in the presence of a penetrating magnetic field. In a clean system the vortex-lattice phase can melt due to thermal fluctuations; we estimate the phase boundary in a variety of regimes. Pinning of vortices due to impurities or other defects destroys the long-range correlations of the vortex lattice, probably replacing it with a new vortex-glass phase that has spin-glasslike off-diagonal long-range order and is truly superconducting, in contrast to conventional theories of ``flux creep.'' The properties of this vortex-glass phase are examined, as well as the critical behavior near the transition from the vortex-glass to the vortex-fluid phase. The crossover from lattice to vortex-glass behavior for weak pinning is also examined. Linear and nonlinear conductivity measurements and other experiments on the high-${\mathit{T}}_{\mathit{c}}$ superconductors Y-Ba-Cu-O and Bi-Sr-Ca-Cu-O are discussed in light of the results. The latter is found to exhibit strongly two-dimensional behavior over large portions of its phase diagram.

Security and Composition of Multiparty Cryptographic Protocols

Abstract: We present general definitions of security for multiparty cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation. The definitions follow the general paradigm of known definitions; yet some substantial modifications and simplifications are introduced. The composition operation is the natural ``subroutine substitution'' operation, formalized by Micali and Rogaway. We consider several standard settings for multiparty protocols, including the cases of eavesdropping, Byzantine, nonadaptive and adaptive adversaries, as well as the information-theoretic and the computational models. In particular, in the computational model we provide the first definition of security of protocols that is shown to be preserved under composition.

Temporal difference learning and TD-Gammon

Abstract: Ever since the days of Shannon's proposal for a chess-playing algorithm [12] and Samuel's checkers-learning program [10] the domain of complex board games such as Go, chess, checkers, Othello, and backgammon has been widely regarded as an ideal testing ground for exploring a variety of concepts and approaches in artificial intelligence and machine learning. Such board games offer the challenge of tremendous complexity and sophistication required to play at expert level. At the same time, the problem inputs and performance measures are clear-cut and well defined, and the game environment is readily automated in that it is easy to simulate the board, the rules of legal play, and the rules regarding when the game is over and determining the outcome.