Sciweavers

876 search results - page 20 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 11 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ICASSP
2011
IEEE
13 years 2 months ago
Exploiting active-learning strategies for annotating prosodic events with limited labeled data
Many applications of spoken-language systems can benefit from having access to annotations of prosodic events. Unfortunately, obtaining human annotations of these events, even se...
Raul Fernandez, Bhuvana Ramabhadran
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 4 months ago
Minimum Distance Localization for a Robot with Limited Visibility
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
Malvika Rao, Gregory Dudek, Sue Whitesides
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
ASIACRYPT
2009
Springer
14 years 5 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro