Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
33
views
28
references
 Top references
cited by
24
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,834
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      On the Size of Pairing-Based Non-interactive Arguments

      other
      Author(s):
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      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

          Shafi Goldwasser, Silvio Micali, Charles Rackoff (1989)
          Article 0 comments Cited 314 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Non-interactive zero-knowledge and its applications

            Manuel R Blum, Paul A Feldman, Silvio Micali (1988)
            Article 0 comments Cited 97 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Pinocchio: Nearly Practical Verifiable Computation

              M. Raykova, J. Howell, C. Gentry … (2013)
              Article 0 comments Cited 67 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2016
                Publication date (Online): April 28 2016
                Pages: 305-326
                DOI: 10.1007/978-3-662-49896-5_11
                SO-VID: a708af9f-5b21-48bc-a395-1e968747a9b3
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content4,834

                See all similar

                Cited by24

                See all cited by