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
32
views
27
references
Top references
cited by
8
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,986
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2012
Message Authentication, Revisited
other
Author(s):
Yevgeniy Dodis
,
Eike Kiltz
,
Krzysztof Pietrzak
,
Daniel Wichs
Publication date
(Print):
2012
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
Most cited references
27
Record
: found
Abstract
: not found
Article
: not found
New hash functions and their use in authentication and set equality
Mark Wegman
,
J.Lawrence Carter
(1981)
0
comments
Cited
268
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Ronald Cramer
,
Victor Shoup
(1998)
0
comments
Cited
177
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
153
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 355-374
DOI:
10.1007/978-3-642-29011-4_22
SO-VID:
5a832389-45fb-49dc-8e55-3ee5659256a4
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,986
Journeys of creation: experiencing the unknown, the Other and authenticity as an epiphany of the self
Authors:
Stephen Wearing
,
Matthew McDonald
,
Jo Ankor
An efficient anonymous authentication scheme for wireless body area networks using elliptic curve cryptosystem.
Authors:
Zhenguo Zhao
History, progeny, and locations of crabapples of documented authentic origin
Authors:
RM Jefferson
,
R.M. Jefferson
,
C.R. Division
…
See all similar
Cited by
8
Short Randomizable Signatures
Authors:
David Pointcheval
,
Olivier Sanders
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
Authors:
Olivier Blazy
,
Eike Kiltz
,
Jiaxin Pan
Quasi-Adaptive NIZK for Linear Subspaces Revisited
Authors:
Eike Kiltz
,
Hoeteck Wee
See all cited by