Show simple item record

dc.contributor.authorBauer, David
dc.contributor.authorBlough, Douglas M.
dc.date.accessioned2009-12-11T18:17:41Z
dc.date.available2009-12-11T18:17:41Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/1853/31365
dc.description.abstractStorage of personal information by service providers risks privacy loss from data breaches. Our prior work on minimal disclosure credentials presented a mechanism to limit the amount of personal information provided. In that work, personal data was broken into individual claims, which can be released in arbitrary subsets while still being cryptographically verifiable. In applying that work, we encountered the problem of connections between claims, which manifest as disclosure dependencies. In further prior work, we provide an efficient way to provide minimal disclosure, but with cryptographic enforcement of dependencies between claims, as specified by the claims certifier. Now, this work provides security proofs showing that the scheme is secure against forgery and the violation of dependencies in the random oracle model. Additional motivation is provided for a preservation of privacy and security in the standard model.en
dc.language.isoen_USen
dc.publisherGeorgia Institute of Technologyen
dc.relation.ispartofseriesCERCS ; GIT-CERCS-09-05en
dc.subjectDependencyen
dc.subjectHash-treeen
dc.subjectManagementen
dc.subjectMerkle treeen
dc.subjectRedactableen
dc.subjectSignature schemeen
dc.titleAnalysis of a Redactable Signature Scheme on Data With Dependenciesen
dc.typeTechnical Reporten
dc.contributor.corporatenameGeorgia Institute of Technology. Center for Experimental Research in Computer Systems
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record