Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?.
Ahto BuldasMargus NiitsooPublished in: ProvSec (2008)
Keyphrases
- hash functions
- collision free
- path planning
- motion planning
- similarity search
- dynamic environments
- locality sensitive
- order preserving
- locality sensitive hashing
- path planner
- collision avoidance
- mobile robot
- hamming distance
- free space
- nearest neighbor search
- binary codes
- search algorithm
- approximate similarity search
- secret key