Results 1  10
of
4,718,406
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 12976 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
Maximum likelihood from incomplete data via the EM algorithm
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract

Cited by 11807 (17 self)
 Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
LeakageResilient ElGamal
, 2010
"... Blinding is a popular and wellknown countermeasure to protect publickey cryptosystems against sidechannel attacks. The high level idea is to randomize an exponentiation in order to prevent multiple measurements of the same operation on different data, as such measurements might allow the adversar ..."
Abstract
 Add to MetaCart
. In particular, we propose a muliplicatively blinded version of ElGamal publickey encryption where • we prove that the scheme, instantiated over bilinear groups of prime order p (where p−1 is not smooth) is leakageresilient in the genericgroup model. Here we consider the model of chosencipherext security
Fully LeakageResilient Signatures
, 2010
"... A signature scheme is fully leakage resilient (Katz and Vaikuntanathan, ASIACRYPT ’09) if it is existentially unforgeable under an adaptive chosenmessage attack even in a setting where an adversary may obtain bounded (yet arbitrary) leakage information on all intermediate values that are used throu ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
throughout the lifetime of the system. This is a strong and meaningful notion of security that captures a wide range of sidechannel attacks. One of the main challenges in constructing fully leakageresilient signature schemes is dealing with leakage that may depend on the random bits used by the signing
LeakageResilient Cryptography from Minimal Assumptions
, 2012
"... We present new constructions of leakageresilient cryptosystems, which remain provably secure even if the attacker learns some arbitrary partial information about their internal secret key. For any polynomial ℓ, we can instantiate these schemes so as to tolerate up to ℓ bits of leakage. While there ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
there has been much prior work constructing such leakageresilient cryptosystems under concrete numbertheoretic and algebraic assumptions, we present the first schemes under general and minimal assumptions. In particular, we construct: • Leakageresilient publickey encryption from any standard publickey
Practical LeakageResilient IdentityBased Encryption from Simple Assumptions
 ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY
, 2010
"... We design the first LeakageResilient IdentityBased Encryp tion (LRIBE) systems from static assumptions in the stan dard model. We derive these schemes by applying a hash proof technique from Alwen et al. (Eurocrypt '10) to variants of the existing IBE schemes of BonehBoyen, Waters, and Le ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
We design the first LeakageResilient IdentityBased Encryp tion (LRIBE) systems from static assumptions in the stan dard model. We derive these schemes by applying a hash proof technique from Alwen et al. (Eurocrypt '10) to variants of the existing IBE schemes of BonehBoyen, Waters
CCASecure IBKEM from IdentityBased Extractable Hash Proof Systems
"... Abstract. In this paper, we introduce a general paradigm called identitybased extractable hash proof system (IBEHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10). We show how to construct identitybased key encapsulation mechanism (IBKEM) from IBEHP ..."
Abstract
 Add to MetaCart
, respectively. Key words: identitybased extractable hash proof, identitybased key encapsulation mechanism, CCA security, BDH assumption 1
doi:10.1093/comjnl/bxt090 CCASecure IBKEM from IdentityBased Extractable Hash Proof System†
, 2013
"... In this paper, we introduce a general paradigm called identitybased extractable hash proof system (IBEHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO’10). We show how to construct identitybased key encapsulation mechanism (IBKEM) from IBEHPS in a simp ..."
Abstract
 Add to MetaCart
simple and modular fashion. Our construction provides a generic method of building and interpreting CCAsecure IBKEMs based on computational assumptions. As instantiations, we realize IBEHPS from the bilinear Diffie–Hellman assumption and the modified bilinear Diffie–Hellman assumption, respectively
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
Results 1  10
of
4,718,406