Results 1  10
of
610
Bilinear Map
"... � Identifiability crucial in inverse problems � Not well understood for nonlinear systems/constraints � We develop theory for Bilinear Inverse Problems � subsumes blind estimation � deterministic characterization of identifiability � probabilistic scaling law � general conic constraints included, e ..."
Abstract
 Add to MetaCart
� Identifiability crucial in inverse problems � Not well understood for nonlinear systems/constraints � We develop theory for Bilinear Inverse Problems � subsumes blind estimation � deterministic characterization of identifiability � probabilistic scaling law � general conic constraints included
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
, 2002
"... An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single short signature. This single signature (and the n original messages) will convince the verif ..."
Abstract

Cited by 336 (12 self)
 Add to MetaCart
construct an efficient aggregate signature from a recent short signature scheme based on bilinear maps due to Boneh, Lynn, and Shacham. Aggregate signatures are useful for reducing the size of certificate chains (by aggregating all signatures in the chain) and for reducing message size in secure routing
NONSINGULAR BILINEAR MAPS, SPACES OF . . .
, 2005
"... We present in this short paper relations between vector spaces of matrices which satisfy some rank conditions, problem of the existence of nonsingular bilinear maps and the problem of the existence of immersions and embeddings of real projective spaces into Euclidean spaces. ..."
Abstract
 Add to MetaCart
We present in this short paper relations between vector spaces of matrices which satisfy some rank conditions, problem of the existence of nonsingular bilinear maps and the problem of the existence of immersions and embeddings of real projective spaces into Euclidean spaces.
Signature schemes and anonymous credentials from bilinear maps
, 2004
"... We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discretelogarithmbased assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf (LRSW) who also showed that it holds for generic groups and is independent of th ..."
Abstract

Cited by 234 (23 self)
 Add to MetaCart
of the decisional DiffieHellman assumption. We prove security of our scheme under the LRSW assumption for groups with bilinear maps. We then show how our scheme can be used to construct efficient anonymous credential systems as well as group signature and identity escrow schemes. To this end, we provide efficient
BILINEAR MAPS ON ARTINIAN MODULES
"... Abstract. It is shown that if a bilinear map f: A × B → C of modules over a commutative ring k is nondegenerate (i.e., if no nonzero element of A annihilates all of B, and vice versa), and A and B are Artinian, then A and B are of finite length. Some consequences are noted. Counterexamples are given ..."
Abstract
 Add to MetaCart
Abstract. It is shown that if a bilinear map f: A × B → C of modules over a commutative ring k is nondegenerate (i.e., if no nonzero element of A annihilates all of B, and vice versa), and A and B are Artinian, then A and B are of finite length. Some consequences are noted. Counterexamples
DiffieHellman Problems and Bilinear Maps
, 2002
"... We investigate relations among the discrete logarithm (DL) problem, the DiffieHellman (DH) problem and the bilinear DiffieHellman (BDH) problem when we have an efficient computable nondegenerate bilinear map e : G G ! H. Under a certain assumption on the order of G, we show that the DH problem on ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We investigate relations among the discrete logarithm (DL) problem, the DiffieHellman (DH) problem and the bilinear DiffieHellman (BDH) problem when we have an efficient computable nondegenerate bilinear map e : G G ! H. Under a certain assumption on the order of G, we show that the DH problem
Aggregate Signatures using Bilinear Maps
"... Bilinear maps have been used in many revolutionary cryptographic schemes in the past decade. In fact, ever since the emergence of Identity Based Encryption by Boneh and Franklin [1], bilinear maps have been consistently used to construct shorter signatures [3], more powerful encryption schemes, such ..."
Abstract
 Add to MetaCart
Bilinear maps have been used in many revolutionary cryptographic schemes in the past decade. In fact, ever since the emergence of Identity Based Encryption by Boneh and Franklin [1], bilinear maps have been consistently used to construct shorter signatures [3], more powerful encryption schemes
Bilinear maps in Verifiable Random Functions
"... One of the biggest reasons for the popularity and versatility of elliptic curves in cryptography, besides the lack of “betterthanblackbox ” discrete log algorithms, is the presence of a bilinear map. In this short paper, we look into the definitions, motivations, and constructions of VRFs and not ..."
Abstract
 Add to MetaCart
One of the biggest reasons for the popularity and versatility of elliptic curves in cryptography, besides the lack of “betterthanblackbox ” discrete log algorithms, is the presence of a bilinear map. In this short paper, we look into the definitions, motivations, and constructions of VRFs
Closures in ℵ0categorical bilinear maps
 J. Symbolic Logic
, 2000
"... Alternating bilinear maps with few relations allow to define a combinatorial closure similarly as in [2]. For the ℵ0categorical case we show that this closure is part of the algebraic closure. 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Alternating bilinear maps with few relations allow to define a combinatorial closure similarly as in [2]. For the ℵ0categorical case we show that this closure is part of the algebraic closure. 1
Results 1  10
of
610