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
16
views
35
references
 Top references
cited by
2
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,734
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Verifying Concurrent Processes Using Temporal Logic 

      GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates

      other
      Author(s): , ,
      Publication date (Online):
      Publisher: Springer International Publishing

      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 references35

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

          Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

          Sanjam Garg, Craig Gentry, Shai Halevi … (2013)
          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
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Candidate Multilinear Maps from Ideal Lattices

              Sanjam Garg, Craig Gentry, Shai Halevi (2013)
              Article 0 comments Cited 83 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2018
                Publication date (Online): July 24 2018
                Pages: 577-607
                DOI: 10.1007/978-3-319-96881-0_20
                SO-VID: 92f90af2-e3c9-42e6-af1c-eb6c7d0915ce
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,734

                See all similar

                Cited by2

                See all cited by