Sciweavers

1871 search results - page 10 / 375
» The Ephemeral Pairing Problem
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg
COCOON
2008
Springer
13 years 9 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
IJISEC
2007
61views more  IJISEC 2007»
13 years 7 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
ICML
2001
IEEE
14 years 8 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
13 years 11 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...