Montenegro, Jose A.; Fischer, Michael J.; Lopez, Javier; Peralta, Rene Secure sealed-bid online auctions using discreet cryptographic proofs. (English) Zbl 1286.94079 Math. Comput. Modelling 57, No. 11-12, 2583-2595 (2013). MSC: 94A60 PDFBibTeX XMLCite \textit{J. A. Montenegro} et al., Math. Comput. Modelling 57, No. 11--12, 2583--2595 (2013; Zbl 1286.94079) Full Text: DOI
Fischer, Michael J. Estimating parameters of monotone Boolean functions. (Abstract). (English) Zbl 0925.94109 Hsu, Wen-Lian (ed.) et al., Computing and combinatorics. 4th annual international conference, COCOON ’98, Taipei, Taiwan, ROC, August 12–14, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1449, 3 (1998). MSC: 94C10 06E30 PDFBibTeX XMLCite \textit{M. J. Fischer}, Lect. Notes Comput. Sci. 1449, 3 (1998; Zbl 0925.94109)
Fischer, M. J.; Micali, S.; Rackoff, C. A secure protocol for the oblivious transfer. (Extended abstract). (English) Zbl 0861.94015 J. Cryptology 9, No. 3, 191-195 (1996). Reviewer: J.Vyskoč (Bratislava) MSC: 94A60 68P25 PDFBibTeX XMLCite \textit{M. J. Fischer} et al., J. Cryptology 9, No. 3, 191--195 (1996; Zbl 0861.94015)
Fischer, Michael J.; Wright, Rebecca N. Bounds on secret key exchange using a random deal of cards. (English) Zbl 0851.94018 J. Cryptology 9, No. 2, 71-99 (1996). MSC: 94A60 68P25 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{R. N. Wright}, J. Cryptology 9, No. 2, 71--99 (1996; Zbl 0851.94018)
Fischer, Michael J.; Wright, Rebecca N. An application of game-theoretic techniques to cryptography. (English) Zbl 0803.90148 Cai, Jin-Yi (ed.), Advances in computational complexity theory. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 13, 99-118 (1993). Reviewer: R.N.Wright (Holmdel, U.S.A.) MSC: 91A80 94A60 68W15 91A05 91A46 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{R. N. Wright}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 13, 99--118 (1993; Zbl 0803.90148)
Fischer, Michael J.; Wright, Rebecca N. An efficient protocol for unconditionally secure secret key exchange. (English) Zbl 0798.94009 Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 475-483 (1993). MSC: 94A60 68P25 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{R. N. Wright}, in: Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 475--483 (1993; Zbl 0798.94009)
Fischer, Michael J.; Wright, Rebecca N. Multiparty secret key exchange using a random deal of cards. (English) Zbl 0763.94010 Advances in cryptology, Proc. Conf., CRYPTO ’91, Santa Barbara/CA (USA) 1991, Lect. Notes Comput. Sci. 576, 141-155 (1992). MSC: 94A60 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{R. N. Wright}, Lect. Notes Comput. Sci. 576, 141--155 (1992; Zbl 0763.94010)
Fischer, Michael J.; Paterson, Michael S.; Rackoff, Charles Secret bit transmission using a random deal of cards. (English) Zbl 0722.94019 Distributed computing and cryptography, Proc. Workshop, Princeton/NJ (USA) 1989, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 2, 173-181 (1991). MSC: 94A60 68P25 PDFBibTeX XML
Broder, Andrei; Dolev, Danny; Fischer, Michael; Simons, Barbara Efficient fault-tolerant routings in networks. (English) Zbl 0622.94034 Inf. Comput. 75, 52-64 (1987). MSC: 94C15 68R10 PDFBibTeX XMLCite \textit{A. Broder} et al., Inf. Comput. 75, 52--64 (1987; Zbl 0622.94034) Full Text: DOI
Dolev, Danny; Fischer, Michael J.; Fowler, Rob; Lynch, Nancy A.; Strong, H. Raymond An efficient algorithm for Byzantine agreement without authentication. (English) Zbl 0507.68017 Inf. Control 52, 257-274 (1982). MSC: 68N25 94A99 PDFBibTeX XMLCite \textit{D. Dolev} et al., Inf. Control 52, 257--274 (1982; Zbl 0507.68017) Full Text: DOI
Fischer, Michael J.; Meyer, Albert R.; Paterson, Michael S. Omega(n log n) lower bounds on length of Boolean formulas. (English) Zbl 0488.94036 SIAM J. Comput. 11, 416-427 (1982). MSC: 94C10 68Q25 PDFBibTeX XMLCite \textit{M. J. Fischer} et al., SIAM J. Comput. 11, 416--427 (1982; Zbl 0488.94036) Full Text: DOI
Galbiati, G.; Fischer, M. J. On the complexity of 2-output Boolean networks. (English) Zbl 0473.94021 Theor. Comput. Sci. 16, 177-185 (1981). MSC: 94C10 68Q25 PDFBibTeX XMLCite \textit{G. Galbiati} and \textit{M. J. Fischer}, Theor. Comput. Sci. 16, 177--185 (1981; Zbl 0473.94021) Full Text: DOI
Ladner, Richard E.; Fischer, Michael J. Parallel prefix computation. (English) Zbl 0445.68066 J. Assoc. Comput. Mach. 27, 831-838 (1980). MSC: 94C10 68Q45 68Q25 PDFBibTeX XMLCite \textit{R. E. Ladner} and \textit{M. J. Fischer}, J. Assoc. Comput. Mach. 27, 831--838 (1980; Zbl 0445.68066) Full Text: DOI
Pippenger, Nicholas; Fischer, Michael J. Relations among complexity measures. (English) Zbl 0405.68041 J. Assoc. Comput. Mach. 26, 361-381 (1979). MSC: 68Q25 94C10 68Q05 68U20 PDFBibTeX XMLCite \textit{N. Pippenger} and \textit{M. J. Fischer}, J. Assoc. Comput. Mach. 26, 361--381 (1979; Zbl 0405.68041) Full Text: DOI
Goodrich, Glenn B.; Ladner, Richard E.; Fischer, Michael J. Straight-line programs to compute finite languages. (English) Zbl 0409.68025 Proc. Conf. theoretical computer science, Waterloo/Ontario 1977, 221-229 (1977). MSC: 68Q25 68Q45 94C10 PDFBibTeX XML
Fischer, M. J. A queueing analysis of an integrated telecommunications system with priorities. (English) Zbl 0389.90053 INFOR 15, 277-288 (1977). MSC: 90B22 90B10 94C05 PDFBibTeX XMLCite \textit{M. J. Fischer}, INFOR 15, 277--288 (1977; Zbl 0389.90053) Full Text: DOI
Fischer, M. J.; Harris, T. C. A model for evaluating the performance of an integrated circuit- and packet-switched multiplex structure. (English) Zbl 0344.94001 IEEE Trans. Commun. 24, 195-202 (1976). MSC: 94A05 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{T. C. Harris}, IEEE Trans. Commun. 24, 195--202 (1976; Zbl 0344.94001) Full Text: DOI
Fischer, Michael J.; Meyer, Albert R.; Paterson, Michael S. Lower bounds on the size of Boolean formulas: Preliminary report. (English) Zbl 0381.94028 Proc. 7th ann. ACM Symp. Theory Comput., Albuquerque 1975, 37-44 (1975). MSC: 94C10 PDFBibTeX XML
Fischer, Michael J. The complexity of negation-limited networks - a brief survey. (English) Zbl 0327.68055 Autom. Theor. form. Lang., 2nd GI Conf., Kaiserslautern 1975, Lect. Notes Comput. Sci. 33, 71-82 (1975). MSC: 68Q25 68T15 94C10 PDFBibTeX XML