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
27
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
1,784
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2004
How to Compress Rabin Ciphertexts and Signatures (and More)
other
Author(s):
Craig Gentry
Publication date
(Print):
2004
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
ScienceOpen Research
Most cited references
27
Record
: found
Abstract
: not found
Book Chapter
: not found
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Dan Boneh
,
Craig Gentry
,
Ben Lynn
…
(2003)
0
comments
Cited
119
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
Book Chapter
: not found
An Identity Based Encryption Scheme Based on Quadratic Residues
Clifford Cocks
(2001)
0
comments
Cited
106
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Pages
: 179-200
DOI:
10.1007/978-3-540-28628-8_11
SO-VID:
ee4d17be-9457-4f6a-a504-bd19dad3ef47
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On Multiple Linear Approximations
pp. 317
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
pp. 92
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
pp. 106
Security of Random Feistel Schemes with 5 or More Rounds
pp. 140
Compressed Pairings
pp. 179
How to Compress Rabin Ciphertexts and Signatures (and More)
pp. 220
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks
pp. 254
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
pp. 273
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
pp. 290
Near-Collisions of SHA-0
pp. 306
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
pp. 335
Round-Optimal Secure Two-Party Computation
pp. 390
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
pp. 407
Faster Correlation Attack on Bluetooth Keystream Generator E0
pp. 426
A New Paradigm of Hybrid Encryption Scheme
pp. 443
Secure Identity Based Encryption Without Random Oracles
pp. 460
Non-interactive Timestamping in the Bounded Storage Model
pp. 494
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
pp. 511
Efficient Tree-Based Revocation in Groups of Low-State Devices
Similar content
1,784
Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints
Authors:
Minyoung Jung
,
Bernd Burgstaller
,
Johann Blieberger
Resolving Rabin's Paradox
Authors:
H Bleichrodt
,
Jason Doctor
,
Y Gao
…
Implementation of the Gold-Rabiner pitch detector in a real time environment using an improved voicing detector
Authors:
H. Hassanein
,
B. Bryden
See all similar
Cited by
5
On Compression of Data Encrypted With Block Ciphers
Authors:
Demijan Klinc
,
Carmit Hazay
,
Ashish Jagmohan
…
Batch Verification of Short Signatures
Authors:
Michael Østergaard Pedersen
,
Susan Hohenberger
,
Jan Camenisch
Probabilistic Analyses of Lattice Reduction Algorithms
Authors:
Brigitte Vallee
,
Antonio Vera
See all cited by