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
105
views
47
references
 Top references
cited by
28
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      5,783
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Theory of Cryptography 

      Succinct Non-interactive Arguments via Linear Interactive Proofs

      other

      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 references47

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

          Pascal Paillier (1999)
          Article 0 comments Cited 366 times – based on 0 reviews
            Bookmark
            • 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 320 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Proof verification and the hardness of approximation problems

              Sanjeev Arora, Carsten Lund, Rajeev Motwani … (1998)
              Article 0 comments Cited 157 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2013
                Pages: 315-333
                DOI: 10.1007/978-3-642-36594-2_18
                SO-VID: a63e447b-d351-4d3a-b25f-02699b20c92e
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content5,783

                See all similar

                Cited by28

                See all cited by