Sciweavers

1786 search results - page 2 / 358
» The Structure of Factor Oracles
Sort
View
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
14 years 4 months ago
Oracular Partially Observable Markov Decision Processes: A Very Special Case
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
Nicholas Armstrong-Crews, Manuela M. Veloso
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
12 years 6 days ago
Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Ka...
ASIACRYPT
2007
Springer
14 years 4 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
CSL
2001
Springer
14 years 2 months ago
The Anatomy of Innocence
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
Vincent Danos, Russell Harmer
ICPADS
2008
IEEE
14 years 4 months ago
SkyEye.KOM: An Information Management Over-Overlay for Getting the Oracle View on Structured P2P Systems
In order to ease the development and maintenance of more complex P2P applications, which combine multiple P2P functionality (e.g. streaming and dependable storage), we suggest to ...
Kalman Graffi, Aleksandra Kovacevic, Song Xiao, Ra...