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
49
views
36
references
 Top references
cited by
16
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,540
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors

      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 references36

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

          Public-key cryptosystems provably secure against chosen ciphertext attacks

          M. Yung, M Naor (1990)
          Article 0 comments Cited 103 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Generating hard instances of lattice problems (extended abstract)

            M. Ajtai (1996)
            Article 0 comments Cited 100 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

              Daniele Micciancio, Oded Regev (2007)
              Article 0 comments Cited 95 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2016
                Publication date (Online): April 28 2016
                Pages: 1-31
                DOI: 10.1007/978-3-662-49896-5_1
                SO-VID: 527064e7-d91a-4e09-9fc7-25eb7c54a73f
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,540

                See all similar

                Cited by20

                See all cited by