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
61
views
25
references
Top references
cited by
45
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,237
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - CRYPTO 2009
Public-Key Cryptosystems Resilient to Key Leakage
other
Author(s):
Moni Naor
,
Gil Segev
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
Amsterdam University Press Books
Most cited references
25
Record
: found
Abstract
: not found
Book Chapter
: not found
Private Circuits: Securing Hardware against Probing Attacks
Yuval Ishai
,
Amit Sahai
,
David N Wagner
(2003)
0
comments
Cited
112
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
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):
2009
Pages
: 18-35
DOI:
10.1007/978-3-642-03356-8_2
SO-VID:
d793f0ba-8338-4859-a30c-bb0087e21c13
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Reconstructing RSA Private Keys from Random Key Bits
pp. 18
Public-Key Cryptosystems Resilient to Key Leakage
pp. 317
Batch Binary Edwards
pp. 355
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
pp. 541
Privacy-Enhancing Auctions Using Rational Cryptography
pp. 36
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
pp. 55
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
pp. 108
Randomizable Proofs and Delegatable Anonymous Credentials
pp. 126
Computational Differential Privacy
pp. 143
Probabilistically Checkable Arguments
pp. 177
On the Amortized Complexity of Zero-Knowledge Protocols
pp. 192
Linear Algebra with Sub-linear Zero-Knowledge Arguments
pp. 286
How to Encipher Messages on a Small Domain
pp. 303
How to Hash into Elliptic Curves
pp. 374
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
pp. 408
Improving the Security of Quantum Protocols via Commit-and-Open
pp. 445
How Risky Is the Random-Oracle Model?
pp. 577
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
pp. 595
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
pp. 654
Short and Stateless Signatures from the RSA Assumption
Similar content
3,237
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Authors:
Magali Bardet
,
Pierre Briaud
,
Maxime Bros
…
Analysis of the efficiency of the Chor–Rivest cryptosystem implementation in a safe-parameter range
Authors:
L. Hernández Encinas
,
J. Masque
,
A. Dios
Public key cryptosystem based security in wireless body area network
Authors:
A. Sangari
,
J. Martin Leo Manickam
See all similar
Cited by
45
Public-Key Cryptosystems Resilient to Key Leakage
Authors:
Moni Naor
,
Gil Segev
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Authors:
Sebastian Faust
,
Tal Rabin
,
Leonid Reyzin
…
Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
Authors:
Alexandre Duc
,
Stefan Dziembowski
,
Sebastian Faust
See all cited by