Sciweavers

2654 search results - page 63 / 531
» On Pairing Inversion Problems
Sort
View
INDOCRYPT
2004
Springer
15 years 9 months ago
New ID-Based Threshold Signature Scheme from Bilinear Pairings
ID-based public key systems allow the user to use his/her identity as the public key, which can simplify key management procedure compared with CA-based public key systems. However...
Xiaofeng Chen, Fangguo Zhang, Divyan M. Konidala, ...
EUROCRYPT
2010
Springer
15 years 9 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 11 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
ILP
2003
Springer
15 years 9 months ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
15 years 8 months ago
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
David Freeman