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
32
views
41
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
4,279
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - EUROCRYPT 2015
Quasi-Adaptive NIZK for Linear Subspaces Revisited
other
Author(s):
Eike Kiltz
,
Hoeteck Wee
Publication date
(Online):
April 14 2015
Publisher:
Springer Berlin Heidelberg
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
41
Record
: found
Abstract
: not found
Book Chapter
: not found
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Ronald Cramer
,
Victor Shoup
(1998)
0
comments
Cited
177
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Efficient Identity-Based Encryption Without Random Oracles
Brent Waters
(2005)
0
comments
Cited
153
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Ronald Cramer
,
Victor Shoup
(2002)
0
comments
Cited
101
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
April 14 2015
Pages
: 101-128
DOI:
10.1007/978-3-662-46803-6_4
SO-VID:
1b266c3c-e2a1-4449-9b8d-9365e0bcd236
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Universal Signature Aggregators
pp. 35
Fully Structure-Preserving Signatures and Shrinking Commitments
pp. 69
Disjunctions for Hash Proof Systems: New Constructions and Applications
pp. 101
Quasi-Adaptive NIZK for Linear Subspaces Revisited
pp. 131
Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
pp. 159
Noisy Leakage Revisited
pp. 191
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
pp. 220
Two Halves Make a Whole
pp. 253
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
pp. 313
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
pp. 337
Function Secret Sharing
pp. 371
Cluster Computing in Zero Knowledge
pp. 404
Hosting Services on an Untrusted Cloud
pp. 439
How to Obfuscate Programs Directly
pp. 468
End-to-End Verifiable Elections in the Standard Model
pp. 501
Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
pp. 532
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
pp. 595
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
pp. 627
Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
pp. 657
Cryptographic Reverse Firewalls
pp. 689
Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols
pp. 719
Authenticated Key Exchange from Ideal Lattices
pp. 755
Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
pp. 785
Privacy Amplification in the Isolated Qubits Model
pp. 817
Generic Hardness of the Multiple Discrete Logarithm Problem
Similar content
4,279
New constructions of reusable designated-verifier NIZKs
Authors:
A. Lombardi
,
W Quach
,
RD Rothblum
…
Dynamic sparse subspace clustering for evolving high-dimensional data streams
Authors:
J SUI
,
Z Liu
,
L Liu
…
Semi-supervised transfer subspace for domain adaptation
Authors:
Luís A.M. Pereira
,
Ricardo da Silva Torres
See all similar
Cited by
5
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
Authors:
Pyrros Chaidos
,
Geoffroy Couteau
Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
Authors:
Charanjit S. Jutla
,
Arnab Roy
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
Authors:
Keita Emura
,
Takuya Hayashi
See all cited by