{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:38:23Z","timestamp":1776425903194,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545088","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_7","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"94-107","source":"Crossref","is-referenced-by-count":37,"title":["One-Way Group Actions"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Brassard","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., J. Feigenbaum, and J. Kilian, \u201cOn hiding information from an oracle\u201d, Journal of Computer and System Sciences, Vol. 39, 1989, pp. 21\u201350.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR2","unstructured":"Angluin, D. and D. Lichtenstein, \u201cProvable security of cryptosystems: A survey\u201d, Technical Report Yaleu\/dcs\/tr-288, Department of Computer Science, Yale University, 1983."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., S. Micali, and R. Ostrovsky, \u201cPerfect zero-knowledge in constant rounds\u201d, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 482\u2013493.","DOI":"10.1145\/100216.100283"},{"key":"7_CR4","unstructured":"Bennett, C.H. and G. Brassard, \u201cQuantum cryptography: Public key distribution and coin tossing\u201d, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, December 1984, pp. 175\u2013179."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M. and S. Kannan, \u201cDesigning programs that check their work\u201d, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 86\u201397.","DOI":"10.1145\/73007.73015"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M. and S. Micali, \u201cHow to generate cryptographically strong sequences of pseudo-random bits\u201d, SIAM Journal on Computing, Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Boyar, J. F., M. W. Krentel, and S. A. Kurtz, \u201cA discrete logarithm implementation of zero-knowledge blobs\u201d, Journal of Cryptology, Vol. 2, no. 2, 1990.","DOI":"10.1007\/BF00204448"},{"key":"7_CR8","unstructured":"Brassard, G., \u201cCryptology column \u2014 Bit commitment schemes\u201d, Sigact News, in preparation, 1991."},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., D. Chaum, and C. Cr\u00e9peau, \u201cMinimum disclosure proofs of knowledge\u201d, Journal of Computer and System Sciences, Vol. 37, no. 2, 1988, pp. 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR10","unstructured":"Brassard, G. and C. Cr\u00e9peau, \u201cZero-knowledge simulation of Boolean circuits\u201d, Advances in Cryptology: CRYPTO\u2019 86 Proceedings, Springer-Verlag, 1987, pp. 224\u2013233."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Brassard, G. and C. Cr\u00e9peau, \u201cNon-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond\u201d, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 188\u2013195.","DOI":"10.1109\/SFCS.1986.33"},{"key":"7_CR12","unstructured":"Brassard, G. and C. Cr\u00e9peau, \u201cQuantum bit commitment and coin tossing protocols\u201d, Advances in Cryptology: these CRYPTO\u2019 90 Proceedings, Springer-Verlag."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0035756","volume-title":"Automata, Languages and Programming","author":"Gilles Brassard","year":"1989","unstructured":"Brassard, G., C. Cr\u00e9peau, and M. Yung, \u201cEverything in NP can be argued in perfect zero-knowledge in a bounded number of rounds\u201d, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Springer-Verlag, 1989, pp. 123\u2013136. Final paper to appear in Theoretical Computer Science under the title of \u201cConstant-round perfect zero-knowledge computationally convincing protocols\u201d."},{"key":"7_CR14","unstructured":"Burmester, M. V. D., Y. G. Desmedt, F. Piper, and M. Walker, \u201cA meta zero-knowledge scheme\u201d, Proceedings of CO89 Combinatorial Optimization Conference, University of Leeds, July 1989. Submitted for journal publication."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Chaum, D., \u201cDemonstrating that a public predicate can be satisfied without revealing any information about how\u201d, Advances in Cryptology: CRYPTO\u2019 86 Proceedings, Springer-Verlag, 1987, pp. 195\u2013199.","DOI":"10.1007\/3-540-47721-7_13"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., I. B. Damg\u00e5rd, and J. van de Graaf, \u201cMultiparty computations ensuring privacy of each party\u2019s input and correctness of the result\u201d, Advances in Cryptology: CRYPTO\u2019 87 Proceedings, Springer-Verlag, 1988, pp. 87\u2013119.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U. and A. Shamir, \u201cZero knowledge proofs of knowledge in two rounds\u201d, Advances in Cryptology: CRYPTO\u2019 89 Proceedings, Springer-Verlag, 1990, pp. 526\u2013544.","DOI":"10.1007\/0-387-34805-0_46"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., S. Kannan, and N. Nisan, \u201cLower bounds on random self-reducibility\u201d, Proceedings of the 5th IEEE Structure in Complexity Theory Conference, 1990.","DOI":"10.1109\/SCT.1990.113959"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \u201cProofs that yield nothing but their validity and a methodology of cryptographic protocol design\u201d, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems\u201d, SIAM Journal on Computing, Vol. 18, no. 1, 1989, pp. 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., S. Micali, and R. Rivest, \u201cA secure digital signature scheme\u201d, SIAM Journal on Computing, Vol. 17, no. 2, 1988, pp. 281\u2013308.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., \u201cPseudo-random generators under uniform assumptions\u201d, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., L. Levin, and M. Luby, \u201cPseudo-random generation from one-way functions\u201d, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R. and M. Luby, \u201cOne-way functions are essential for complexity based cryptography\u201d, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 230\u2013235.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R. and M. Naor, \u201cEfficient cryptographic schemes provably as secure as subset sum\u201d, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 236\u2013241.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R. and M. Yung, \u201cDirect minimum-knowledge computations\u201d, Advances in Cryptology: CRYPTO\u2019 87 Proceedings, Springer-Verlag, 1988, pp. 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.","DOI":"10.1007\/978-3-322-96647-6"},{"key":"7_CR28","unstructured":"Maurer, U. M., \u201cFast generation of secure RSA-moduli with almost maximal diversity\u201d, Advances in Cryptology: EUROCRYPT\u2019 89 Proceedings, Springer-Verlag, to appear."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Naor, M., \u201cBit commitment using pseudo-randomness\u201d, Advances in Cryptology: CRYPTO\u2019 89 Proceedings, Springer-Verlag, 1990, pp. 128\u2013136.","DOI":"10.1007\/0-387-34805-0_13"},{"key":"7_CR30","unstructured":"Naor, M., R. Ostrovsky, R. Venkatesan, and M. Yung, manuscript, 1990."},{"key":"7_CR31","unstructured":"Ostrovsky, R., R. Venkatesan, and M. Yung, manuscript, 1990."},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S. and M. E. Hellman, \u201cAn improved algorithm for computing logarithms over GF(p) and its cryptographic significance\u201d, IEEE Transactions on Information Theory, Vol. IT-24, 1978, pp. 106\u2013110.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR33","unstructured":"Shizuya, H. and T. Itoh, \u201cA group-theoretic interface to random self-reducibility\u201d, Transactions of the Institute of Electronics, Information and Communication Engineers (IEICE) of Japan, Section E, Vol. E73, no. 7, July 25, 1990."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Tompa, M. and H. Woll, \u201cRandom self-reducibility and zero-knowledge proofs of possession of knowledge\u201d, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:23Z","timestamp":1619572823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_7","relation":{},"subject":[]}}