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
13
views
16
references
Top references
cited by
0
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,935
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
other
Author(s):
Seungjoo Kim
,
Jung Hee Cheon
,
Marc Joye
,
Seongan Lim
,
Masahiro Mambo
,
Dongho Won
,
Yuliang Zheng
Publication date
(Online):
December 4 2001
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
Embodied Memory
Most cited references
16
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
Optimal asymmetric encryption
Mihir Bellare
,
Phillip Rogaway
(1995)
0
comments
Cited
114
times
– based on
0
reviews
Bookmark
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
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
December 4 2001
Pages
: 114-127
DOI:
10.1007/3-540-45325-3_11
SO-VID:
da3cf0df-b12a-48cf-bc77-93b1099c646f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
A Statistical Decoding Algorithm for General Linear Block Codes
pp. 9
On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
pp. 20
The Complete Weight Enumerator for Codes over M nxs(F q)
pp. 27
Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem
pp. 38
A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
pp. 44
A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks
pp. 73
The Exact Security of ECIES in the Generic Group Model
pp. 85
A New Ultrafast Stream Cipher Design: COS Ciphers
pp. 99
On Rabin-Type Signatures
pp. 114
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
pp. 138
Almost-Certainly Runlength-Limiting Codes
pp. 148
Weight vs. Magnetization Enumerator for Gallager Codes
pp. 158
Graph Configurations and Decoding Performance
pp. 166
A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
pp. 176
The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems
pp. 191
Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
pp. 205
Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding
pp. 222
The Wide Trail Design Strategy
pp. 245
Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies
pp. 277
Unconditionally Secure Key Agreement Protocol
pp. 294
An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices
pp. 301
Investigation of Linear Codes Possessing Some Extra Properties
pp. 307
Statistical Physics of Low Density Parity Check Error Correcting Codes
pp. 317
Generating Large Instances of the Gong-Harn Cryptosystem
pp. 329
Lattice Attacks on RSA-Encrypted IP and TCP
pp. 339
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
pp. 355
Attacking the Affine Parts of SFLASH
pp. 364
Another Way of Doing RSA Cryptography in Hardware
pp. 374
Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers
pp. 378
A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
pp. 387
A New Undeniable Signature Scheme Using Smart Cards
pp. 395
Non-binary Block Inseparable Errors Control Codes
pp. 402
Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding
Similar content
1,935
Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions
Authors:
Song Wan
,
Yuliang Lü
,
Xuehu Yan
…
RTI's INGRES chosen for project athena at MIT
Authors:
Antitumor CAR T-cell Screening Platform: Many Are Called, but Few Are Chosen.
Authors:
Olivier Adotévi
,
Jeanne Galaine
See all similar