Sciweavers

516 search results - page 70 / 104
» Sets of k-Independent Strings
Sort
View
EUROCRYPT
2007
Springer
14 years 2 months ago
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
Krzysztof Pietrzak, Johan Sjödin
TCC
2007
Springer
114views Cryptology» more  TCC 2007»
14 years 2 months ago
Multi-authority Attribute Based Encryption
Abstract. In an identity based encryption scheme, each user is identified by a unique identity string. An attribute based encryption scheme (ABE), in contrast, is a scheme in whic...
Melissa Chase
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
14 years 2 months ago
Language-based Feedback Control Using Monte Carlo Sensing
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
Sean B. Andersson, Dimitrios Hristu-Varsakelis
WABI
2004
Springer
106views Bioinformatics» more  WABI 2004»
14 years 2 months ago
Suboptimal Local Alignments Across Multiple Scoring Schemes
Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local ali...
Morris Michael, Christoph Dieterich, Jens Stoye
EUSFLAT
2001
13 years 10 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens