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
34
views
20
references
Top references
cited by
26
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,091
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2012
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
other
Author(s):
Allison Lewko
Publication date
(Print):
2012
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
REPO4EU WP2 Tools
Most cited references
20
Record
: found
Abstract
: not found
Book Chapter
: not found
Identity-Based Cryptosystems and Signature Schemes
Adi Shamir
(1985)
0
comments
Cited
330
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Efficient Identity-Based Encryption Without Random Oracles
Brent Waters
(2005)
0
comments
Cited
152
times
– based on
0
reviews
Bookmark
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
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 318-335
DOI:
10.1007/978-3-642-29011-4_20
SO-VID:
382b634a-d480-497c-adf3-b38c02e81b57
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 27
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
pp. 45
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
pp. 117
Identity-Based Encryption Resilient to Continual Auxiliary Leakage
pp. 135
Quantum Proofs of Knowledge
pp. 228
Identity-Based (Lossy) Trapdoor Functions and Applications
pp. 246
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
pp. 263
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
pp. 318
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
pp. 336
Minimalism in Cryptography: The Even-Mansour Scheme Revisited
pp. 355
Message Authentication, Revisited
pp. 392
Narrow-Bicliques: Cryptanalysis of Full IDEA
pp. 428
Statistical Tools Flavor Side-Channel Collision Attacks
pp. 446
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
pp. 465
Fully Homomorphic Encryption with Polylog Overhead
pp. 502
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
pp. 572
Tightly-Secure Signatures from Lossy Identification Schemes
pp. 591
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
pp. 609
Scalable Group Signatures with Revocation
pp. 628
Incremental Deterministic Public-Key Encryption
pp. 645
Standard Security Does Not Imply Security against Selective-Opening
pp. 719
Pseudorandom Functions and Lattices
pp. 738
Lattice Signatures without Trapdoors
Similar content
2,091
Toward Blockchains for Health-Care Systems: Applying the Bilinear Pairing Technology to Ensure Privacy Protection and Accuracy in Data Sharing
Authors:
Hsin-Te Wu
,
Chun-Wei Tsai
Analyticity of transition semigroups and closability of bilinear forms in Hilbert spaces
Authors:
Marco Fuhrman
A strong provably secure IBE scheme without bilinear map
Authors:
Minghui Zheng
,
Yang Xiang
,
Huihua Zhou
See all similar
Cited by
26
Fully, (Almost) Tightly Secure IBE and Dual System Groups
Authors:
Jie Chen
,
Hoeteck Wee
Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
Authors:
Yannis Rouselakis
,
Brent Waters
An Algebraic Framework for Diffie-Hellman Assumptions
Authors:
Alex Escala
,
Gottfried Herold
,
Eike Kiltz
…
See all cited by