One-way group actions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 537 LNCS, Issue , 1991, Pages 94-107

  Brassard, Gilles ^a   Yung, Moti ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BIT COMMITMENT; COMPUTING POWER; GRAPH ISOMORPHISM; GROUP ACTIONS; ONE-WAY GROUP HOMOMORPHISMS; PARALLELIZATIONS; UNIFIED THEORY; ZERO-KNOWLEDGE PROTOCOLS;

CRYPTOGRAPHY;

EID: 84931031941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_7     Document Type: Conference Paper

References (34)

1. Abadi, M., J. Feigenbaum, and J. Kilian, “On hiding information from an oracle”, Journal of Computer and System Sciences, Vol. 39, 1989, pp. 21-50.
2. Angluin, D. and D. Lichtenstein, “Provable security of cryptosystems: A survey”, Technical Report YALEU/DCS/TR-288, Department of Computer Science, Yale University, 1983.
3. Bellare, M., S. Micali, and R. Ostrovsky, “Perfect zero-knowledge in constant rounds”, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 482-493.
4. Bennett, C.H. and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing”, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, December 1984, pp. 175-179.
5. Blum, M. and S. Kannan, “Designing programs that check their work”, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 86-97.
6. Blum, M. and S. Micali, “How to generate cryptographically strong sequences of pseudo-random bits”, SIAM Journal on Computing, Vol. 13, 1984, pp. 850-864.
7. Boyar, J. F., M. W. Krentel, and S. A. Kurtz, “A discrete logarithm implementation of zero-knowledge blobs”, Journal of Cryptology, Vol. 2, no. 2, 1990.
8. Brassard, G., “Cryptology column - Bit commitment schemes”, Sigact News, in preparation, 1991.
9. Brassard, G., D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge”, Journal of Computer and System Sciences, Vol. 37, no. 2, 1988, pp. 156-189.
10. Brassard, G. and C. Crépeau, “Zero-knowledge simulation of Boolean circuits”, Advances in Cryptology: CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp. 224-233.
11. Brassard, G. and C. Crépeau, “Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 188-195.
12. Brassard, G. and C. Crépeau, “Quantum bit commitment and coin tossing protocols”, Advances in Cryptology: these CRYPTO '90 Proceedings, SpringerVerlag.
13. Brassard, G., C. Crépeau, and M. Yung, “Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds”, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Springer-Verlag, 1989, pp. 123-136. Final paper to appear in Theoretical Computer Science under the title of “Constant-round perfect zero-knowledge computationally convincing protocols”.
14. Burmester, M.V. D., Y. G. Desmedt, F. Piper, and M. Walker, “A meta zero-knowledge scheme”, Proceedings of C089 Combinatorial Optimization Conference, University of Leeds, July 1989. Submitted for journal publication.
15. Chaum, D., “Demonstrating that a public predicate can be satisfied without revealing any information about how”, Advances in Cryptology: CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp. 195-199.
16. Chaum, D., I. B. Damgård, and J. van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result”, Advances in Cryptology: CRYPTO '87 Proceedings, Springer-Verlag, 1988, pp. 87-119.
17. Feige, U. and A. Shamir, “Zero knowledge proofs of knowledge in two rounds”, Advances in Cryptology: CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp. 526-544.
18. Feigenbaum, J., S. Kannan, and N. Nisan, “Lower bounds on random self-reducibility”, Proceedings of the 5th IEEE Structure in Complexity Theory Conference, 1990.
19. Goldreich, O., S. Micali, and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 174-187.
20. Goldwasser, S., S. Micali, and C. Rackoff, “The knowledge complexity of interactive proof systems”, SIAM Journal on Computing, Vol. 18, no. 1, 1989, pp. 186-208.
21. Goldwasser, S., S. Micali, and R. Rivest, “A secure digital signature scheme”, SIAM Journal on Computing, Vol. 17, no. 2, 1988, pp. 281-308.
22. Ilåstad, J., “Pseudo-random generators under uniform assumptions”, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 395-404.
23. Impagliazzo, R., L. Levin, and M. Luby, “Pseudo-random generation from one-way functions”, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 12-24.
24. Impagliazzo, R. and M. Luby, “One-way functions are essential for complexity based cryptography”, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 230-235.
25. Impagliazzo, R. and M. Naor, “Efficient cryptographic schemes provably as secure as subset sum”, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 236-241.
26. Impagliazzo, R. and M. Yung, “Direct minimum-knowledge computations”, Advances in Cryptology: CRYPTO '87 Proceedings, Springer-Verlag, 1988, pp. 40-51.
27. Kranakis, E., Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.
28. Maurer, U.M., “Fast generation of secure RSA-moduli with almost maximal diversity”, Advances in Cryptology: EUROCRYPT '89 Proceedings, SpringerVerlag, to appear.
29. Naor, M., “Bit commitment using pseudo-randomness”, Advances in Cryptology: CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp. 128-136.
30. Naor, M., R. Ostrovsky, R. Venkatesan, and M. Yung, manuscript, 1990.
31. Ostrovsky, R., R. Venkatesan, and M. Yung, manuscript, 1990.
32. Pohlig, S. and M.E. Heilman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Transactions on Information Theory, Vol. IT-24, 1978, pp. 106-110.
33. Shizuya, H. and T. Itoh, “A group-theoretic interface to random self-reducibility”, Transactions of the Institute of Electronics, Information and Communication Engineers (IEICE) of Japan, Section E, Vol. E73, no. 7, July 25, 1990.
34. Tompa, M. and H. Woll, “Random self-reducibility and zero-knowledge proofs of possession of knowledge”, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 472-482.