Name
Abstract | ||
|---|---|---|
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem.We then apply the subgroup membership problem to private information retrieval schemes following the method by Kushilevitz and Ostrovsky. The resulting scheme has the same communication complexity as that of Kushilevitz and Ostrovsky. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-47719-5_18 | ACISP |
Keywords | Field | DocType |
cryptographic system,resulting scheme,private information retrieval scheme,private information retrieval,communication complexity,algorithmic problem,subgroup membership problem | Semantic security,Cryptography,Computer science,Digital signature,Theoretical computer science,Communication complexity,Anonymity,Security parameter,Private information retrieval,Traceability | Conference |
Volume | ISSN | ISBN |
2119 | 0302-9743 | 3-540-42300-1 |
Citations | PageRank | References |
20 | 0.93 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Yamamura | 1 | 96 | 13.29 |
| Taiichi Saito | 2 | 64 | 9.85 |