mirror of
https://github.com/Decentralized-ID/decentralized-id.github.io.git
synced 2024-12-19 04:24:47 -05:00
Update README.md
This commit is contained in:
parent
db21bc454b
commit
cef71c5ec2
@ -28,7 +28,7 @@
|
|||||||
* [Windley.com](#Selected-articles-from-Windley.com)
|
* [Windley.com](#Selected-articles-from-Windley.com)
|
||||||
* [Tykn Tech](#Tykn-Tech)
|
* [Tykn Tech](#Tykn-Tech)
|
||||||
* [Hyperledger Indy](#Hyperledger-Indy)
|
* [Hyperledger Indy](#Hyperledger-Indy)
|
||||||
* [IDEMix—Zero Knowledge Proofs in Indy](#IDEMix-Zero-Knowledge-Proofs-in-Indy)
|
* [IDEMix—Zero Knowledge Proofs in Indy](#IDEMix)
|
||||||
* [IBM](#IBM)
|
* [IBM](#IBM)
|
||||||
* [Ethereum—Protocol](#Ethereum)
|
* [Ethereum—Protocol](#Ethereum)
|
||||||
* [Ethereum Apps](#Ethereum-Identity-Applications)
|
* [Ethereum Apps](#Ethereum-Identity-Applications)
|
||||||
@ -290,7 +290,7 @@ Evident from [whitepapers](https://github.com/WebOfTrustInfo/ID2020DesignWorksho
|
|||||||
* [Hyperledger Welcomes Project Indy](https://www.hyperledger.org/blog/2017/05/02/hyperledger-welcomes-project-indy) - ANN
|
* [Hyperledger Welcomes Project Indy](https://www.hyperledger.org/blog/2017/05/02/hyperledger-welcomes-project-indy) - ANN
|
||||||
* [The Rise of Self-Sovereign Identity - Hyperledger Indy](https://wso2.com/blog/research/the-rise-of-self-sovereign-identity-hyperledger-indy)
|
* [The Rise of Self-Sovereign Identity - Hyperledger Indy](https://wso2.com/blog/research/the-rise-of-self-sovereign-identity-hyperledger-indy)
|
||||||
* [Plenum Bzantine Fault Tolerant Protocol](https://github.com/hyperledger/indy-plenum/wiki)
|
* [Plenum Bzantine Fault Tolerant Protocol](https://github.com/hyperledger/indy-plenum/wiki)
|
||||||
* "Byzantine fault tolerance is a sub-field of fault tolerance research inspired by the Byzantine Generals' Problem, which is a generalized version of the Two Generals' Problem."
|
* "Byzantine fault tolerance is a sub-field of fault tolerance research inspired by the Byzantine Generals' Problem, which is a generalized version of the Two Generals' Problem."—Zero Knowledge Proofs in Indy
|
||||||
* [An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials](https://eprint.iacr.org/2008/539.pdf)
|
* [An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials](https://eprint.iacr.org/2008/539.pdf)
|
||||||
* [An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation](https://www.iacr.org/archive/eurocrypt2001/20450093.pdf)
|
* [An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation](https://www.iacr.org/archive/eurocrypt2001/20450093.pdf)
|
||||||
* [SecureKey Technologies to explore interoperability between Verified.Me and Hyperledger Indy](https://securekey.com/press-releases/hyperledger-indy/)
|
* [SecureKey Technologies to explore interoperability between Verified.Me and Hyperledger Indy](https://securekey.com/press-releases/hyperledger-indy/)
|
||||||
@ -302,7 +302,8 @@ Evident from [whitepapers](https://github.com/WebOfTrustInfo/ID2020DesignWorksho
|
|||||||
* [/awesome-sovrin](https://github.com/infominer33/awesome-decentralized-id/tree/master/awesome-sovrin)
|
* [/awesome-sovrin](https://github.com/infominer33/awesome-decentralized-id/tree/master/awesome-sovrin)
|
||||||
|
|
||||||
|
|
||||||
#### IDEMix—Zero Knowledge Proofs in Indy[**^**](#Contents)
|
#### IDEMix [**^**](#Contents)
|
||||||
|
—Zero Knowledge Proofs in Indy
|
||||||
|
|
||||||
>Our zero-knowledge proofs are part of the [Idemix protocol](http://domino.research.ibm.com/library/cyberdig.nsf/papers/EEB54FF3B91C1D648525759B004FBBB1/%24File/rz3730_revised.pdf), where they are used to prove the possession of [Camenisch-Lysyanskaya credentials](https://eprint.iacr.org/2001/019.pdf). We also use zero-knowledge proofs in the revocation protocol, which is based on [cryptographic accumulators](https://eprint.iacr.org/2008/539.pdf). —*[What Zero Knowledge Poof Algorithm is used in Sovrin?](https://forum.sovrin.org/t/what-zero-knowledge-proof-algorithm-is-used-in-sovrin/71/2)*
|
>Our zero-knowledge proofs are part of the [Idemix protocol](http://domino.research.ibm.com/library/cyberdig.nsf/papers/EEB54FF3B91C1D648525759B004FBBB1/%24File/rz3730_revised.pdf), where they are used to prove the possession of [Camenisch-Lysyanskaya credentials](https://eprint.iacr.org/2001/019.pdf). We also use zero-knowledge proofs in the revocation protocol, which is based on [cryptographic accumulators](https://eprint.iacr.org/2008/539.pdf). —*[What Zero Knowledge Poof Algorithm is used in Sovrin?](https://forum.sovrin.org/t/what-zero-knowledge-proof-algorithm-is-used-in-sovrin/71/2)*
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user