Analysis of a Redactable Signature Scheme on Data With Dependencies

Show simple item record Bauer, David Blough, Douglas M. 2009-12-11T18:17:41Z 2009-12-11T18:17:41Z 2009
dc.description.abstract Storage 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.iso en_US en
dc.publisher Georgia Institute of Technology en
dc.relation.ispartofseries CERCS ; GIT-CERCS-09-05 en
dc.subject Dependency en
dc.subject Hash-tree en
dc.subject Management en
dc.subject Merkle tree en
dc.subject Redactable en
dc.subject Signature scheme en
dc.title Analysis of a Redactable Signature Scheme on Data With Dependencies en
dc.type Technical Report en
dc.contributor.corporatename Georgia Institute of Technology. Center for Experimental Research in Computer Systems
dc.contributor.corporatename Georgia Institute of Technology. School of Electrical and Computer Engineering

Files in this item

Files Size Format View
git-cercs-09-05.pdf 125.1Kb PDF View/ Open

This item appears in the following Collection(s)

Show simple item record