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
Sign in
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
Sign in
Register
Dashboard
Search
17
views
35
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,452
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):
Yilei Chen
,
Vinod Vaikuntanathan
,
Hoeteck Wee
Publication date
(Online):
July 24 2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
ScienceOpen Research
Most cited references
35
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)
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)
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)
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
Sign in to comment
Book chapters
pp. 1
Introduction
pp. 1
Introduction
pp. 3
Simplifying Game-Based Definitions
pp. 13
Review of the theories on agents as intentional systems
pp. 3
Programming environment
pp. 33
The Algebraic Group Model and its Applications
pp. 15
Verification
pp. 51
A formal theory of commitments
pp. 65
On Tightly Secure Non-Interactive Key Exchange
pp. 27
Temporal logic
pp. 83
Specification of reasoning behind interactions
pp. 95
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange
pp. 101
Modelling interactions in COSY agent architecture
pp. 129
Fast Correlation Attack Revisited
pp. 36
Chapter 5. Techniques
pp. 133
Summary and conclusion
pp. 160
A Key-Recovery Attack on 855-round Trivium
pp. 70
Network protocols
pp. 157
Resource allocation
pp. 185
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities
pp. 183
Conclusion
pp. 213
Bernstein Bound on WCS is Tight
pp. 241
Correcting Subverted Random Oracles
pp. 272
Combiners for Backdoored Random Oracles
pp. 303
On Distributional Collision Resistant Hashing
pp. 331
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries
pp. 362
Trapdoor Functions from the Computational Diffie-Hellman Assumption
pp. 395
Round-Optimal Secure Multiparty Computation with Honest Majority
pp. 425
On the Exact Round Complexity of Secure Three-Party Computation
pp. 459
Promise Zero Knowledge and Its Applications to Round Optimal MPC
pp. 488
Round-Optimal Secure Multi-Party Computation
pp. 523
Yes, There is an Oblivious RAM Lower Bound!
pp. 543
Constrained PRFs for \(\mathrm{NC}^1\) in Traditional Groups
pp. 577
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
pp. 608
Lower Bounds on Lattice Enumeration with Extreme Pruning
pp. 638
Dissection-BKW
pp. 669
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
pp. 700
Lattice-Based Zero-Knowledge Arguments for Integer Relations
pp. 769
SPD\(\mathbb {Z}_{2^k}\): Efficient MPC mod \(2^k\) for Dishonest Majority
pp. 799
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
Similar content
1,452
Fault Diagnosis of Rolling Bearing Based on Multiscale Intrinsic Mode Function Permutation Entropy and a Stacked Sparse Denoising Autoencoder
Authors:
Juying Dai
,
Jian Tang
,
Faming Shao
…
A Bayesian joint model of multiple longitudinal and categorical outcomes with application to multiple myeloma using permutation-based variable importance
Authors:
Danilo Alvares
,
Jessica K. Barrett
,
François Mercier
…
Permutation Wordle
Authors:
Samuel A. Kutin
,
Lawren M. Smithline
See all similar
Cited by
2
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
Authors:
Shweta Agrawal
,
Yuval Ishai
,
Eyal Kushilevitz
…
(Commit-and-Prove) Predictable Arguments with Privacy
Authors:
Hamidreza Khoshakhlagh
See all cited by