{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:05:57Z","timestamp":1725494757535},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76969-9_3","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:32:49Z","timestamp":1195003969000},"page":"34-46","source":"Crossref","is-referenced-by-count":2,"title":["Fast Digital Signature Algorithm Based on Subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"Lor\u00e1nd","family":"Sz\u0151ll\u0151si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Marosits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Feh\u00e9r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Recski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"B. Schneier","year":"1993","unstructured":"Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., New York (1993)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adelman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT\/LCS\/TM-82 (1977)","DOI":"10.21236\/ADA606588"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, D., Santesson, S., Farrell, S., Boeyen, S., Housley, R., Polk, W.: Internet x.509 public key infrastructure certificate and certificate revocation list (crl) profile (internet-draft) (2006), http:\/\/www.ietf.org\/internet-drafts\/draft-ietf-pkix-rfc3280bis-06.txt","DOI":"10.17487\/rfc4325"},{"key":"3_CR4","unstructured":"Courtois, N.T., Goubin, L., Patarin, J.: Sflashv3, a fast asymmetric signature scheme. Cryptology ePrint Archive, Report 2003\/211 (2003), http:\/\/eprint.iacr.org\/"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_19","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"H. Gilbert","year":"2002","unstructured":"Gilbert, H., Minier, M.: Cryptanalysis of sflash. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, Springer, Heidelberg (2002)"},{"key":"3_CR6","unstructured":"Dubois, V., Fouque, P.A., Shamir, A., Stern, J.: Breaking sflash, http:\/\/www.ecrypt.eu.org\/webnews\/webnews1206.htm#sflash"},{"key":"3_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge, MA (1990)"},{"key":"3_CR8","unstructured":"Merkle, R.C.: A certified digital signature. In: Proceedings on Advances in Cryptology (1989)"},{"key":"3_CR9","unstructured":"European Parliament and Council: Directive 1999\/93\/ec on a community framework for electronic signatures (1999), http:\/\/europa.eu.int\/ISPO\/legal\/en\/ecommerc\/digsig.html http:\/\/www.legi-internet.ro\/diresignature.htm"},{"key":"3_CR10","unstructured":"U.S. House of Representative: Uniform electronic transactions act (UETA), http:\/\/www4.law.cornell.edu\/uscode\/15\/7001.html"},{"key":"3_CR11","unstructured":"U.S. House of Representative: Electronic signatures in global and national commerce act (e-sign) (2000), http:\/\/frwebgate.access.gpo.gov\/cgi-bin\/getdoc.cgi?dbname106_cong_public_laws&docidf:publ229.106.pdf"},{"key":"3_CR12","unstructured":"Aaronson, S.: (Complexity zoo), http:\/\/qwiki.caltech.edu\/wiki\/Complexity_Zoo"},{"key":"3_CR13","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of computing","author":"R. Venkatesan","year":"1988","unstructured":"Venkatesan, R., Levin, L.: Random instances of a graph coloring problem are hard. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of computing, ACM Press, New York (1988)"},{"key":"3_CR14","unstructured":"Levin, L.A., Venkatesan, R.: An average case NP-complete graph problem. Computer Science (2001)"},{"key":"3_CR15","unstructured":"Xu, S., Zhu, H., Zhang, G.: Digital signature schemes based on graph isomorphism and graph 3-colorability problems In: Proceedings of CrypTEC 1999"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Filotti, I.S., Mayer, J.N.: A polynomial time algorithm for determining isomorphism of graphs of fixed genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)","DOI":"10.1145\/800141.804671"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)","DOI":"10.1145\/800141.804670"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. In: Proceedings of 21st IEEE FOCS Symp. (1980)","DOI":"10.1109\/SFCS.1980.24"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Babai, L., Grigoryev, D.Y., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982)","DOI":"10.1145\/800070.802206"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Ichikawa, S., Yamamoto, S.: Data dependent circuit for subgraph isomorphism problem. In: Proceedings of 12th Int\u2019l Conf. on Field Programmable Logic and Applications (2002)","DOI":"10.1007\/3-540-46117-5_109"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. In: European Symposium on Algorithms (1996)","DOI":"10.1007\/3-540-61680-2_78"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. tcs\u00a0164 (1996)","DOI":"10.1016\/0304-3975(96)00046-1"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theor. Comput. Sci.\u00a063(3) (1989)","DOI":"10.1016\/0304-3975(89)90011-X"},{"issue":"4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"A. Lingas","year":"1988","unstructured":"Lingas, A., Syslo, M.M.: A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. In: Lepist\u00f6, T., Salomaa, A. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0317, Springer, Heidelberg (1988)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 1996","author":"A. Gupta","year":"1996","unstructured":"Gupta, A., Nishimura, N.: Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, Springer, Heidelberg (1996)"},{"key":"3_CR27","volume-title":"Handbook of Combinatorics","author":"L. Babai","year":"1995","unstructured":"Babai, L.: Automorphism groups, isomorphism reconstruction. In: Graham, R., Gr\u00f6tschel, M., Asz, L.L. (eds.) Handbook of Combinatorics, Elsevier Science, Amsterdam (1995)"},{"key":"3_CR28","volume-title":"STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Faster isomorphism testing of strongly regular graphs. In: STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, ACM Press, New York (1996)"},{"key":"3_CR29","unstructured":"Biedl, T.: Graph-Theoretic Algorithms. University of Waterloo (2004), http:\/\/www.student.cs.uwaterloo.ca\/~cs762\/Notes\/lecture9.ps"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76969-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:50:53Z","timestamp":1619506253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76969-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769682"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76969-9_3","relation":{},"subject":[]}}