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
41
views
13
references
Top references
cited by
30
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,681
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — EUROCRYPT'98
Optimistic fair exchange of digital signatures
other
Author(s):
N. Asokan
,
Victor Shoup
,
Michael Waidner
Publication date
(Online):
May 25 2006
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
Digital Archaeology
Most cited references
13
Record
: found
Abstract
: not found
Book Chapter
: not found
Lower Bounds for Discrete Logarithms and Related Problems
Victor Shoup
(1997)
0
comments
Cited
119
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Optimal asymmetric encryption
Mihir Bellare
,
Phillip Rogaway
(1995)
0
comments
Cited
114
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Wallet Databases with Observers
David Chaum
,
Torben Pryds Pedersen
(1993)
0
comments
Cited
98
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1998
Publication date (Online):
May 25 2006
Pages
: 591-606
DOI:
10.1007/BFb0054156
SO-VID:
6acdcc9a-1599-4f87-88aa-e444b96cbb84
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Securing threshold cryptosystems against chosen ciphertext attack
pp. 294
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
pp. 32
A practical and provably secure scheme for publicly verifiable secret sharing and its applications
pp. 59
Breaking RSA may not be equivalent to factoring
pp. 72
Lower bounds on generic algorithms in groups
pp. 145
Optimum traitor tracing and asymmetric schemes
pp. 158
On finding small solutions of modular multivariate polynomial equations
pp. 221
Speeding up discrete log and factoring based schemes via precomputations
pp. 236
Fast batch verification for modular exponentiation and digital signatures
pp. 266
Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
pp. 334
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
pp. 361
On the foundations of oblivious transfer
pp. 391
Strengthened security for blind signatures
pp. 406
Generic constructions for secure and efficient confirmer signature schemes
pp. 422
Security analysis of a practical “on the fly” authentication and signature generation
pp. 437
Universally verifiable mix-net with verification work independent of the number of mix-servers
pp. 448
A practical mix
pp. 475
Highly nonlinear balanced Boolean functions with a good correlation-immunity
pp. 489
Heuristic design of cryptographically strong balanced Boolean functions
pp. 512
Combinatorial bounds for broadcast encryption
pp. 561
Easy come — Easy go divisible cash
pp. 591
Optimistic fair exchange of digital signatures
Similar content
2,681
An optimistic approach “from hydrophobic to super hydrophilic nanofibers” for enhanced absorption properties
Authors:
Motahira Hashmi
,
Sana Ullah
,
Azeem Ullah
…
Scaling Techno-Optimistic Visions
Authors:
Seyram Avle
,
Cindy Lin
,
Jean Hardy
…
State boredom results in optimistic perception of risk and increased risk-taking
Authors:
Shane Bench
,
Jac’lyn Bera
,
Jaylee Cox
See all similar
Cited by
30
How to Use Bitcoin to Design Fair Protocols
Authors:
Iddo Bentov
,
Ranjit Kumaresan
Timed Commitments
Authors:
Dan Boneh
,
Moni Naor
A Survey on Blockchain Interoperability: Past, Present, and Future Trends
Authors:
Rafael Belchior
,
André Vasconcelos
,
Sergio Guerreiro
…
See all cited by