2016 IEEE Conference on Communications and Network Security (CNS) 2016
DOI: 10.1109/cns.2016.7860551
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Proofs of Retrievability with improved worst case overhead

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In this article, Proposed a security model for unidirectional conditional proxy re-signature, shows a concrete services and demonstrate the security of services in the random oracle model. Xi.Yu Nai.cao [8] Proof of retrievability (POR) is a service programme to improve a validate storage on remote server that consumer can obtain the information, and Frequently accomplish an successful audit protocol to protect information is complete. In dynamics POR, the complication is to handle the latest variety of the information gains successful update and audit.…”
Section: Literature Surveymentioning
confidence: 99%
“…In this article, Proposed a security model for unidirectional conditional proxy re-signature, shows a concrete services and demonstrate the security of services in the random oracle model. Xi.Yu Nai.cao [8] Proof of retrievability (POR) is a service programme to improve a validate storage on remote server that consumer can obtain the information, and Frequently accomplish an successful audit protocol to protect information is complete. In dynamics POR, the complication is to handle the latest variety of the information gains successful update and audit.…”
Section: Literature Surveymentioning
confidence: 99%