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
46
views
0
references
Top references
cited by
58
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,603
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2005
HMQV: A High-Performance Secure Diffie-Hellman Protocol
other
Author(s):
Hugo Krawczyk
Publication date
(Print):
2005
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
JMIR Publications
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 546-566
DOI:
10.1007/11535218_33
SO-VID:
4f63e92b-d0d5-4277-a07c-779e8356ed91
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Efficient Collision Search Attacks on SHA-0
pp. 17
Finding Collisions in the Full SHA-1
pp. 37
Pebbling and Proofs of Work
pp. 55
Composition Does Not Imply Adaptive Security
pp. 66
On the Discrete Logarithm Problem on Algebraic Tori
pp. 86
A Practical Attack on a Braid Group Based Cryptographic Protocol
pp. 97
The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
pp. 118
Unconditional Characterizations of Non-interactive Zero-Knowledge
pp. 135
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
pp. 152
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
pp. 169
A Formal Treatment of Onion Routing
pp. 188
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
pp. 205
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
pp. 223
Private Searching on Streaming Data
pp. 241
Privacy-Preserving Set Operations
pp. 258
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
pp. 276
Generic Transformation for Scalable Broadcast Encryption Schemes
pp. 293
Authenticating Pervasive Devices with Human Protocols
pp. 309
Secure Communications over Insecure Channels Based on Short Authenticated Strings
pp. 327
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
pp. 344
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
pp. 361
Secure Computation Without Authentication
pp. 378
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
pp. 395
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
pp. 412
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
pp. 430
Merkle-Damgård Revisited: How to Construct a Hash Function
pp. 449
On the Generic Insecurity of the Full Domain Hash
pp. 467
New Monotones and Lower Bounds in Unconditional Two-Party Computation
pp. 478
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
pp. 494
A Quantum Cipher with Near Optimal Key-Recycling
pp. 511
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
pp. 527
Improved Security Analyses for CBC MACs
pp. 546
HMQV: A High-Performance Secure Diffie-Hellman Protocol
Similar content
4,603
Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
Authors:
Neal Koblitz
,
Alfred J. Menezes
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Authors:
Kristiyan Haralambiev
,
Tibor Jager
,
Eike Kiltz
…
Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Authors:
Kocher
,
P.C. Kocher
See all similar
Cited by
58
Stronger Security of Authenticated Key Exchange
Authors:
Brian LaMacchia
,
Kristin Lauter
,
Anton Mityagin
Secure Message Communication Protocol Among Vehicles in Smart City
Authors:
Amit Dua
,
Neeraj Kumar
,
Ashok Das
…
On the Challenges in Designing Identity-Based Privacy-Preserving Authentication Schemes for Mobile Devices
Authors:
Ding Wang
,
Haibo Cheng
,
Debiao He
…
See all cited by