Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). Hover, plain certificates provide a binary identification: either the whole identity of the subject is known, or nothing is known.  propose using a Merkle hash tree structure, whereby it is possible for a single certificate to contain many separate claims or attributes, each of which may be proved independently, without revealing the others. Additionally,  demonstrate how trees from multiple sources can be combined together by modifying the tree structure. This allows claims by different authorities, such as an employer or professional organization, to be combined under a single certificate, without the CA needing to know (or to verify) all of the claims. In addition to describing the hash tree structure and protocols for constructing and verifying our proposed credential,  formally prove that it provides unforgeability and privacy and  present performance results demonstrating its efficiency. As services move from user names and passwords to attribute-based identity verification, efficiency and scalability of claims verification will become a major issue.  have implemented a prototype client-server system, deployed the prototype in Emulab, and evaluated the server-side throughput for attribute-based identity verification. The results show that our approach can perform about 200 identity verifications per second, while the best competing approach can perform only about 2--5 verifications per second. Our approach is, therefore, better suited to today's high-volume b-based services that demand the highest possible throughput.
['David Bauer', 'Douglas M. Blough', 'David Cash']
I am writing a research paper on a idea Minimal information disclosure with efficiently verifiable credentials
[{"from": "human", "value": "I am writing a research paper on a idea Minimal information disclosure with efficiently verifiable credentials"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). Hover, plain certificates provide a binary identification: either the whole identity of the subject is known, or nothing is known.  propose using a Merkle hash tree structure, whereby it is possible for a single certificate to contain many separate claims or attributes, each of which may be proved independently, without revealing the others. Additionally,  demonstrate how trees from multiple sources can be combined together by modifying the tree structure. This allows claims by different authorities, such as an employer or professional organization, to be combined under a single certificate, without the CA needing to know (or to verify) all of the claims. In addition to describing the hash tree structure and protocols for constructing and verifying our proposed credential,  formally prove that it provides unforgeability and privacy and  present performance results demonstrating its efficiency. As services move from user names and passwords to attribute-based identity verification, efficiency and scalability of claims verification will become a major issue.  have implemented a prototype client-server system, deployed the prototype in Emulab, and evaluated the server-side throughput for attribute-based identity verification. The results show that our approach can perform about 200 identity verifications per second, while the best competing approach can perform only about 2--5 verifications per second. Our approach is, therefore, better suited to today's high-volume b-based services that demand the highest possible throughput."}]