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
43
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
922
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2018
Non-malleable Codes from Average-Case Hardness: \({\mathsf {A}}{\mathsf {C}}^0\), Decision Trees, and Streaming Space-Bounded Tampering
other
Author(s):
Marshall Ball
,
Dana Dachman-Soled
,
Mukul Kulkarni
,
Tal Malkin
Publication date
(Online):
March 31 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
Special Series: Research for Policy Decision Making
Most cited references
43
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Public-key cryptosystems provably secure against chosen ciphertext attacks
M. Yung
,
M Naor
(1990)
0
comments
Cited
103
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
A. Sahai
(1999)
0
comments
Cited
25
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions
Yehuda Lindell
(2003)
0
comments
Cited
18
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
March 31 2018
Pages
: 618-650
DOI:
10.1007/978-3-319-78372-7_20
SO-VID:
336f1eda-375b-4d73-b7f4-03efdf040b51
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
On the Existence of Three Round Zero-Knowledge Proofs
pp. 34
Statistical Witness Indistinguishability (and more) in Two Messages
pp. 66
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
pp. 91
Efficient Maliciously Secure Multiparty Computation for RAM
pp. 125
Efficient Circuit-Based PSI via Cuckoo Hashing
pp. 158
Overdrive: Making SPDZ Great Again
pp. 193
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
pp. 222
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
pp. 259
Untagging Tor: A Formal Treatment of Onion Encryption
pp. 294
Exploring the Boundaries of Topology-Hiding Computation
pp. 329
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions
pp. 371
On the Complexity of Simulating Auxiliary Input
pp. 393
Fuzzy Password-Authenticated Key Exchange
pp. 425
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
pp. 456
OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks
pp. 489
Unforgeable Quantum Encryption
pp. 520
Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
pp. 552
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
pp. 589
Non-malleable Randomness Encoders and Their Applications
pp. 618
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$, Decision Trees, and Streaming Space-Bounded Tampering
pp. 653
Naor-Reingold Goes Public: The Complexity of Known-Key Security
pp. 685
Updatable Encryption with Post-Compromise Security
Similar content
922
The superimposed photospheric and stellar wind variability of the O-type supergiant $\mathsf{\alpha}$ Camelopardalis
Authors:
R. K. Prinja
,
N. Markova
,
S Scuderi
…
On the consistency of peculiar GRBs 060218 and 060614 with the $E_\mathsf{p,i}\(– \)E_\mathsf{iso}$ correlation
Authors:
L Amati
,
M. Della Valle
,
F. Frontera
…
Power Strip Packing of Malleable Demands in Smart Grid
Authors:
Mohammad M. Karbasioun
,
Gennady Shaikhet
,
Evangelos Kranakis
…
See all similar
Cited by
3
Revisiting Non-Malleable Secret Sharing
Authors:
Saikrishna Badrinarayanan
,
Akshayaram Srinivasan
Simple Schemes in the Bounded Storage Model
Authors:
Jiaxin Guan
,
Mark Zhandary
Non-Malleable Codes Against Bounded Polynomial Time Tampering
Authors:
Marshall Ball
,
Dana Dachman-Soled
,
Mukul Kulkarni
…
See all cited by