Sciweavers

679 search results - page 73 / 136
» Using decision problems in public key cryptography
Sort
View
EUROCRYPT
2010
Springer
15 years 6 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
JSAC
2011
176views more  JSAC 2011»
14 years 8 months ago
Cross-Layer Routing Using Cooperative Transmission in Vehicular Ad-hoc Networks
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...
Zhiguo Ding, Kin K. Leung
STOC
2003
ACM
116views Algorithms» more  STOC 2003»
15 years 6 months ago
New lattice based cryptographic constructions
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
Oded Regev
DKE
2007
136views more  DKE 2007»
15 years 1 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
SMC
2007
IEEE
116views Control Systems» more  SMC 2007»
15 years 7 months ago
Decision-making under severe uncertainty for autonomous mobile robots
— The field of robotics is on a growth curve, with most of the growth expected in the areas of personal and service robots. As robots become more prevalent in chaotic home and in...
Daniel Berleant, Gary T. Anderson