A t-private k-database information retrieval scheme
✍ Scribed by Carlo Blundo; Paolo D’Arco; Alfredo De Santis
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- English
- Weight
- 147 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1615-5262
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Private information retrieval (PIR) schemes allow a user to retrieve the i th bit of an n-bit data string x, replicated in k 2 databases (in the informationtheoretic setting) or in k 1 databases (in the computational setting), while keeping the value of i private. The main cost measure for such a sc
to cope with the voluminous and gigantic image objects. ## Storage and retrieval of visual data play an important role Since little special development is required in organizing in multimedia systems. We have developed a content-based and retrieving image objects in these systems, many image sche
## Abstract Until recently, most models of information seeking and retrieval did not take into account other searchers or peers in the social/organizational environment (Wilson, 1999). Donald Case's (2007) survey of research on information seeking, needs and behavior further illustrates this omissi