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
24
views
0
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
0
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Lecture Notes in Computer Science
Cryptography and Coding
other
Editor(s):
Matthew G. Parker
Publication date
(Print):
2009
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
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-3-642-10867-9
ISBN (Electronic):
978-3-642-10868-6
Publication date (Print):
2009
DOI:
10.1007/978-3-642-10868-6
SO-VID:
cddac603-3f4a-4fe2-8b0a-71bbba431b97
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 351
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
pp. 38
Codes as Modules over Skew Polynomial Rings
pp. 278
Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes