Knowledge-binding commitments with applications in time-stamping

Authors:
Ahto Buldas;Sven Laur
Affiliations:
Cybernetica AS, Tallinn, Estonia and Tallinn University of Technology, Tallinn, Estonia and University of Tartu, Tartu, Estonia;Helsinki University of Technology, Laboratory for Theoretical Computer Science, TKK, Finland
Venue:
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Year:
2007

Citing 10
Cited 5

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
A guided tour of Chernoff bounds

Information Processing Letters
One-way accumulators: a decentralized alternative to digital signatures

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Secure names for bit-strings

Proceedings of the 4th ACM conference on Computer and communications security
Eliminating counterevidence with applications to accountable certificate management

Journal of Computer Security
Fast Accumulated Hashing

Proceedings of the Third International Workshop on Fast Software Encryption
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Collision-free accumulators and fail-stop signature schemes without trees

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Universally composable time-stamping schemes with audit

ISC'05 Proceedings of the 8th international conference on Information Security
Do broken hash functions affect the security of time-stamping schemes?

ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security

Structural signatures for tree data structures

Proceedings of the VLDB Endowment
How to authenticate graphs without leaking

Proceedings of the 13th International Conference on Extending Database Technology
Optimally tight security proofs for hash-then-publish time-stamping

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Leakage-free redactable signatures

Proceedings of the second ACM conference on Data and Application Security and Privacy
On the feasibility of consistent computations

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

We prove in a non-black-box way that every bounded list and set commitment scheme is knowledge-binding. This is a new and rather strong security condition, which makes the security definitions for time-stamping much more natural compared to the previous definitions, which assume unpredictability of adversaries. As a direct consequence, list and set commitment schemes with partial opening property are sufficient for secure time-stamping if the number of elements has an explicit upper bound N. On the other hand, white-box reductions are in a sense strictly weaker than black-box reductions. Therefore, we also extend and generalize the previously known reductions. The corresponding new reductions are θ(√N) times more efficient, which is important for global-scale time-stamping schemes where N is very large.