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
63
views
9
references
Top references
cited by
32
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,901
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2010
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
other
Author(s):
David Mandell Freeman
Publication date
(Print):
2010
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
Value-based Healthcare
Most cited references
9
Record
: found
Abstract
: not found
Book Chapter
: not found
Evaluating 2-DNF Formulas on Ciphertexts
Dan Boneh
,
Eu-Jin Goh
,
Kobbi Nissim
(2005)
0
comments
Cited
139
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Allison Lewko
,
Brent Waters
(2010)
0
comments
Cited
46
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Taxonomy of Pairing-Friendly Elliptic Curves
David Freeman
,
Michael 'Adrir' Scott
,
Edlyn Teske
(2010)
0
comments
Cited
36
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 44-61
DOI:
10.1007/978-3-642-13190-5_3
SO-VID:
5b16bda1-61ae-45ba-9381-cd4608afacde
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
On Ideal Lattices and Learning with Errors over Rings
pp. 44
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
pp. 113
Public-Key Encryption in the Bounded-Retrieval Model
pp. 135
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
pp. 216
Efficient Device-Independent Quantum Key Distribution
pp. 235
New Generic Algorithms for Hard Knapsacks
pp. 257
Lattice Enumeration Using Extreme Pruning
pp. 279
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
pp. 299
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
pp. 322
Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others
pp. 381
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
pp. 423
Bounded Key-Dependent Message Security
pp. 445
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
pp. 486
Universally Composable Quantum Multi-party Computation
pp. 506
A Simple BGN-Type Cryptosystem from LWE
pp. 523
Bonsai Trees, or How to Delegate a Lattice Basis
pp. 553
Efficient Lattice (H)IBE in the Standard Model
pp. 673
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
Similar content
1,901
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
Authentication of symmetric cryptosystem using anti-aging controller-based true random number generator
Authors:
Yalamanchili Sangeetha
,
Sankararao Majji
,
Ayyagari Srinagesh
…
See all similar
Cited by
32
Charm: a framework for rapidly prototyping cryptosystems
Authors:
Matthew Pagano
,
Michael Rushanan
,
Matthew Green
…
Verifiable Delegation of Computation over Large Datasets
Authors:
Siavosh Benabbas
,
Rosario Gennaro
,
Yevgeniy Vahlis
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
Authors:
Allison Lewko
See all cited by