Provable Data Retrievability

Provable Data Retrievability is a cryptographic verification framework that enables a client to mathematically demonstrate the integrity and retrievability of outsourced data stored on untrusted servers through challenge-response protocols and probabilistic proofs.

135

Publications

11.7K

Citations

355

Authors

178

Institutions

Publications per year

2017–2026

68

Variants

PorProofs Of Retrievability

Authors

355

  1. YY
    Yong Yu

    University of Electronic Science and Technology of China, China

    6 publications · 178 citations

    6

    h-index

  2. AJ
    Ari Juels

    Cornell University, United States

    6 publications · 3.7K citations

    6

    h-index

  3. JN
    Jianbing Ni

    University of Waterloo, Canada

    5 publications · 205 citations

    5

    h-index

  4. AK
    Alptekın Küpçü

    Koç University, Türkiye

    5 publications · 1.5K citations

    5

    h-index

  5. AO
    Alina Oprea

    Northeastern University, United States

    4 publications · 1.5K citations

    4

    h-index

1–5 of 355

Venues

  1. Future Generation Computer Systems

    FGCS · 8 publications · 411 citations

    8

    h-index

  2. Journal of Network and Computer Applications

    JNCA · 6 publications · 390 citations

    6

    h-index

  3. Journal of Information Security and Applications

    JISA · 4 publications · 138 citations

    5

    h-index

  4. IACR Cryptology ePrint Archive

    Repository · 4 publications · 651 citations

    4

    h-index

  5. Computer Standards & Interfaces

    4 publications · 171 citations

    4

    h-index

1–5