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
40
views
38
references
Top references
cited by
5
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
6,077
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Constraint-Hiding Constrained PRFs for NC \(^1\) from LWE
other
Author(s):
Ran Canetti
,
Yilei Chen
Publication date
(Online):
April 01 2017
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
UCL: UN SDG 01 No Poverty
Most cited references
38
Record
: found
Abstract
: not found
Conference Proceedings
: not found
(Leveled) fully homomorphic encryption without bootstrapping
Vinod Vaikuntanathan
,
Zvika Brakerski
,
Craig Gentry
(2012)
0
comments
Cited
125
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
Functional Encryption: Definitions and Challenges
Dan Boneh
,
Amit Sahai
,
Brent Waters
(2011)
0
comments
Cited
83
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
April 01 2017
Pages
: 446-476
DOI:
10.1007/978-3-319-56620-7_16
SO-VID:
5ba8e7e1-68e3-408f-b8da-e6913c51c894
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Revisiting Lattice Attacks on Overstretched NTRU Parameters
pp. 27
Short Generators Without Quantum Computers: The Case of Multiquadratics
pp. 60
Computing Generator in Cyclotomic Integer Rings
pp. 91
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
pp. 122
From Minicrypt to Obfustopia via Private-Key Functional Encryption
pp. 152
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
pp. 185
Computation of a 768-Bit Prime Field Discrete Logarithm
pp. 202
A Kilobit Hidden SNFS Discrete Logarithm Computation
pp. 235
Improved Private Set Intersection Against Malicious Adversaries
pp. 260
Formal Abstractions for Attested Execution Secure Processors
pp. 293
One-Shot Verifiable Encryption from Lattices
pp. 324
Short Stickelberger Class Relations and Application to Ideal-SVP
pp. 351
Concurrently Composable Security with Shielded Super-Polynomial Simulators
pp. 382
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
pp. 415
Private Puncturable PRFs from Standard Lattice Assumptions
pp. 446
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
pp. 479
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
pp. 501
Sublinear Zero-Knowledge Arguments for RAM Programs
pp. 535
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
pp. 567
How Fast Can Higher-Order Masking Be in Software?
pp. 601
Multi-input Inner-Product Functional Encryption from Pairings
pp. 627
Simplifying Design and Analysis of Complex Predicate Encryption Schemes
pp. 659
Twisted $${\mu }_4$$ -Normal Form for Elliptic Curves
pp. 679
Efficient Compression of SIDH Public Keys
Similar content
6,077
Privacy Preserving BGN-Type Parallel Homomorphic Encryption Algorithm Based on LWE. J
Authors:
Z Min
,
G Yang
,
J. Wang
…
A multi-key SMC protocol and multi-key FHE based on some-are- errorless LWE
Authors:
H Wang
,
Y Feng
,
Y DING
…
Ciphertext-policy attribute-based proxy re-encryption via constrained PRFs
Authors:
Zengpeng Li
,
Vishal Sharma
,
Chunguang Ma
…
See all similar
Cited by
5
Constraint-Hiding Constrained PRFs for NC \(^1\) from LWE
Authors:
Ran Canetti
,
Yilei Chen
Private Puncturable PRFs from Standard Lattice Assumptions
Authors:
Dan Boneh
,
Sam Kim
,
Hart Montgomery
Private Constrained PRFs (and More) from LWE
Authors:
Zvika Brakerski
,
Rotem Tsabary
,
Vinod Vaikuntanathan
…
See all cited by