44
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      On the Size of Pairing-Based Non-interactive Arguments

      other
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references28

          • Record: found
          • Abstract: not found
          • Article: not found

          The Knowledge Complexity of Interactive Proof Systems

            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Non-interactive zero-knowledge and its applications

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Pinocchio: Nearly Practical Verifiable Computation

                Bookmark

                Author and book information

                Book Chapter
                2016
                April 28 2016
                : 305-326
                10.1007/978-3-662-49896-5_11
                a708af9f-5b21-48bc-a395-1e968747a9b3
                History

                Comments

                Comment on this book

                Book chapters

                Similar content4,179

                Cited by27