Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Zero-knowledge proofs of identity
Journal of Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
The Complexity of Online Memory Checking
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Compact Proofs of Retrievability
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proofs of Retrievability via Hardness Amplification
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Dynamic provable data possession
Proceedings of the 16th ACM conference on Computer and communications security
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Revocation for delegatable anonymous credentials
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Delegable provable data possession for remote data in the clouds
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Secure and efficient proof of storage with deduplication
Proceedings of the second ACM conference on Data and Application Security and Privacy
Secure network coding over the integers
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Delusional boot: securing hypervisors without massive re-engineering
Proceedings of the 7th ACM european conference on Computer Systems
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Efficient query integrity for outsourced dynamic databases
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Hourglass schemes: how to prove that cloud files are encrypted
Proceedings of the 2012 ACM conference on Computer and communications security
New approaches to security and availability for cloud data
Communications of the ACM
Geolocation of data in the cloud
Proceedings of the third ACM conference on Data and application security and privacy
Proof of possession for cloud storage via lagrangian interpolation techniques
NSS'12 Proceedings of the 6th international conference on Network and System Security
Efficient dynamic provable possession of remote data via balanced update trees
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Using algebraic signatures to check data possession in cloud storage
Future Generation Computer Systems
Transparent, distributed, and replicated dynamic provable data possession
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Data dynamics for remote data possession checking in cloud storage
Computers and Electrical Engineering
Proof of retrieval and ownership protocols for enterprise-level data deduplication
CASCON '13 Proceedings of the 2013 Conference of the Center for Advanced Studies on Collaborative Research
| Hi-index | 0.02 |
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constructed from any homomorphic linear authenticator (HLA). The latter, roughly speaking, are signature/message authentication schemes where `tags' on multiple messages can be homomorphically combined to yield a `tag' on any linear combination of these messages. We provide a framework for building public-key HLAs from any identification protocol satisfying certain homomorphic properties. We then show how to turn any public-key HLA into a publicly-verifiable PoS with communication complexity independent of the file length and supporting an unbounded number of verifications. We illustrate the use of our transformations by applying them to a variant of an identification protocol by Shoup, thus obtaining the first unbounded-use PoS based on factoring (in the random oracle model).