Commitment scheme (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Commitment scheme" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

5iacr.org

5,032^nd place

3,357^th place

4arxiv.org

69^th place

59^th place

3web.archive.org

1^st place

3harvard.edu

18^th place

17^th place

3psu.edu

207^th place

136^th place

2mcgill.ca

2,527^th place

1,840^th place

2springer.com

274^th place

309^th place

2worldcat.org

5^th place

1cmu.edu

1,564^th place

1,028^th place

1books.google.com

3^rd place

1acm.org

1,185^th place

840^th place

1berkeley.edu

580^th place

462^nd place

1rub.de

low place

1handle.net

102^nd place

76^th place

1nih.gov

4^th place

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

Oded Goldreich, Silvio Micali, and Avi Wigderson, Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof systems, Journal of the ACM, 38: 3, pp. 690–728, 1991

arxiv.org (Global: 69^th place; English: 59^th place)

Brassard, Crépeau, Mayers, Salvail: A brief review on the impossibility of quantum bit commitment
A. Kent: Secure classical Bit Commitment using Fixed Capacity Communication Channels
Kent, A. (1999). "Unconditionally Secure Bit Commitment". Phys. Rev. Lett. 83 (7): 1447–1450. arXiv:quant-ph/9810068. Bibcode:1999PhRvL..83.1447K. doi:10.1103/PhysRevLett.83.1447. S2CID 8823466.
Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

berkeley.edu (Global: 580^th place; English: 462^nd place)

cs.berkeley.edu

Wagner, David (2006), Midterm Solution, p. 2, retrieved 26 October 2015

books.google.com (Global: 3^rd place; English: 3^rd place)

A. Shamir, R. L. Rivest, and L. Adleman, "Mental Poker". In David A. Klarner, ed., The Mathematical Gardner (ISBN 978-1-4684-6686-7), pp. 37–43. Wadsworth, Belmont, California, 1981.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Manuel Blum, Coin Flipping by Telephone, Proceedings of CRYPTO 1981, pp. 11–15, 1981, reprinted in SIGACT News vol. 15, pp. 23–27, 1983, Carnegie Mellon School of Computer Science.

doi.org (Global: 2^nd place; English: 2^nd place)

Goldreich, Oded; Micali, Silvio; Wigderson, Avi (1991). "Proofs that yield nothing but their validity". Journal of the ACM. 38 (3): 690–728. CiteSeerX 10.1.1.420.1478. doi:10.1145/116825.116852. S2CID 2389804.
Naor, Moni (1991). "Bit commitment using pseudorandomness". Journal of Cryptology. 4 (2): 151–158. doi:10.1007/BF00196774. S2CID 15002247.
Pedersen, Torben Pryds (1992). "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing". Advances in Cryptology – CRYPTO '91. Lecture Notes in Computer Science. Vol. 576. Berlin, Heidelberg: Springer Berlin Heidelberg. pp. 129–140. doi:10.1007/3-540-46766-1_9. ISBN 978-3-540-55188-1.
Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications". Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science. Vol. 7778. Springer Berlin Heidelberg. pp. 55–72. doi:10.1007/978-3-642-36362-7_5. ISBN 978-3-642-36362-7. Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications" (PDF). International Association for Cryptologic Research.
Kent, A. (1999). "Unconditionally Secure Bit Commitment". Phys. Rev. Lett. 83 (7): 1447–1450. arXiv:quant-ph/9810068. Bibcode:1999PhRvL..83.1447K. doi:10.1103/PhysRevLett.83.1447. S2CID 8823466.
McGrath, Thomas; Bagci, Ibrahim E.; Wang, Zhiming M.; Roedig, Utz; Young, Robert J. (2019-02-12). "A PUF taxonomy". Applied Physics Reviews. 6 (1): 011303. Bibcode:2019ApPRv...6a1303M. doi:10.1063/1.5079407.
Rührmair, Ulrich; van Dijk, Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic Engineering. 3 (1): 17–28. doi:10.1007/s13389-013-0052-8. hdl:1721.1/103985. ISSN 2190-8516. S2CID 15713318.
Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Rührmair, Ulrich; van Dijk, Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic Engineering. 3 (1): 17–28. doi:10.1007/s13389-013-0052-8. hdl:1721.1/103985. ISSN 2190-8516. S2CID 15713318.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Kent, A. (1999). "Unconditionally Secure Bit Commitment". Phys. Rev. Lett. 83 (7): 1447–1450. arXiv:quant-ph/9810068. Bibcode:1999PhRvL..83.1447K. doi:10.1103/PhysRevLett.83.1447. S2CID 8823466.
McGrath, Thomas; Bagci, Ibrahim E.; Wang, Zhiming M.; Roedig, Utz; Young, Robert J. (2019-02-12). "A PUF taxonomy". Applied Physics Reviews. 6 (1): 011303. Bibcode:2019ApPRv...6a1303M. doi:10.1063/1.5079407.
Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

iacr.org (Global: 5,032^nd place; English: 3,357^th place)

eprint.iacr.org

R. Canetti and M. Fischlin. Universally Composable Commitments.
Tang, Chunming; Pei, Dingyi; Liu, Zhuojun; He, Yong (16 August 2004). "Pedersen: Non-interactive and information-theoretic secure verifiable secret sharing" (PDF). Cryptology ePrint Archive. Advances in Cryptology CRYPTO 1991 Springer. Archived from the original (PDF) on 11 August 2017. Retrieved 2 February 2019.
Mouris, Dimitris; Tsoutsos, Nektarios Georgios (26 January 2022). "Masquerade: Verifiable Multi-Party Aggregation with Secure Multiplicative Commitments" (PDF). Cryptology ePrint Archive.

iacr.org

Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications". Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science. Vol. 7778. Springer Berlin Heidelberg. pp. 55–72. doi:10.1007/978-3-642-36362-7_5. ISBN 978-3-642-36362-7. Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications" (PDF). International Association for Cryptologic Research.
Kate, Aniket; Zaverucha, Gregory; Goldberg, Ian (2010). "Constant-size commitments to polynomials and their applications" (PDF). International Conference on the Theory and Application of Cryptology and Information Security.

mcgill.ca (Global: 2,527^th place; English: 1,840^th place)

crypto.cs.mcgill.ca

Gilles Brassard, David Chaum, and Claude Crépeau, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, pp. 156–189, 1988.
Claude Crépeau, Commitment, Cryptography and Quantum Information Lab, McGill University School of Computer Science, accessed April 11, 2008

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

psu.edu (Global: 207^th place; English: 136^th place)

citeseer.ist.psu.edu

Oded Goldreich and Hugo Krawczyk, On the Composition of Zero-Knowledge Proof Systems, SIAM Journal on Computing, 25: 1, pp. 169–192, 1996
"Citations: Bit Commitment using Pseudorandom Generators - Naor (ResearchIndex)". Citeseer.ist.psu.edu. Retrieved 2014-06-07.

citeseerx.ist.psu.edu

Goldreich, Oded; Micali, Silvio; Wigderson, Avi (1991). "Proofs that yield nothing but their validity". Journal of the ACM. 38 (3): 690–728. CiteSeerX 10.1.1.420.1478. doi:10.1145/116825.116852. S2CID 2389804.

rub.de (Global: low place; English: low place)

emsec.rub.de

Becker, Georg (2008-07-18). "Merkle Signature Schemes, Merkle Trees and Their Cryptanalysis" (PDF). Ruhr-Universität Bochum. p. 16. Archived from the original (PDF) on 2014-12-22. Retrieved 2013-11-20.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Goldreich, Oded; Micali, Silvio; Wigderson, Avi (1991). "Proofs that yield nothing but their validity". Journal of the ACM. 38 (3): 690–728. CiteSeerX 10.1.1.420.1478. doi:10.1145/116825.116852. S2CID 2389804.
Naor, Moni (1991). "Bit commitment using pseudorandomness". Journal of Cryptology. 4 (2): 151–158. doi:10.1007/BF00196774. S2CID 15002247.
Kent, A. (1999). "Unconditionally Secure Bit Commitment". Phys. Rev. Lett. 83 (7): 1447–1450. arXiv:quant-ph/9810068. Bibcode:1999PhRvL..83.1447K. doi:10.1103/PhysRevLett.83.1447. S2CID 8823466.
Rührmair, Ulrich; van Dijk, Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic Engineering. 3 (1): 17–28. doi:10.1007/s13389-013-0052-8. hdl:1721.1/103985. ISSN 2190-8516. S2CID 15713318.
Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptology 11(2): 87–108 (1998)[1]
Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications". Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science. Vol. 7778. Springer Berlin Heidelberg. pp. 55–72. doi:10.1007/978-3-642-36362-7_5. ISBN 978-3-642-36362-7. Catalano, Dario; Fiore, Dario (2013). "Vector Commitments and Their Applications" (PDF). International Association for Cryptologic Research.

web.archive.org (Global: 1^st place; English: 1^st place)

Oded Goldreich (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. ISBN 0-521-79172-3.^: 224
Tang, Chunming; Pei, Dingyi; Liu, Zhuojun; He, Yong (16 August 2004). "Pedersen: Non-interactive and information-theoretic secure verifiable secret sharing" (PDF). Cryptology ePrint Archive. Advances in Cryptology CRYPTO 1991 Springer. Archived from the original (PDF) on 11 August 2017. Retrieved 2 February 2019.
Becker, Georg (2008-07-18). "Merkle Signature Schemes, Merkle Trees and Their Cryptanalysis" (PDF). Ruhr-Universität Bochum. p. 16. Archived from the original (PDF) on 2014-12-22. Retrieved 2013-11-20.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Rührmair, Ulrich; van Dijk, Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic Engineering. 3 (1): 17–28. doi:10.1007/s13389-013-0052-8. hdl:1721.1/103985. ISSN 2190-8516. S2CID 15713318.
Nikolopoulos, Georgios M. (2019-09-30). "Optical scheme for cryptographic commitments with physical unclonable keys". Optics Express. 27 (20): 29367–29379. arXiv:1909.13094. Bibcode:2019OExpr..2729367N. doi:10.1364/OE.27.029367. ISSN 1094-4087. PMID 31684673. S2CID 203593129.

Commitment scheme (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

arxiv.org (Global: 69th place; English: 59th place)

berkeley.edu (Global: 580th place; English: 462nd place)