On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures (original) (raw)
Birgit PfitzmannRelated papers
A Remark on a Signature Scheme Where Forgery can be Proved
Lecture Notes in Computer Science, 1991
Signatures dont des falsifications sont prouvables, et leur application
How to Construct Fail-Stop Confirmer Signature Schemes
Lecture Notes in Computer Science, 2001
Proof-of-Forgery for Hash-based Signatures
Proceedings of the 18th International Conference on Security and Cryptography, 2021
Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm
Provable Security, 2010
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
Theoretical Computer Science, 2009
An efficient construction for fail-stop signature for long messages
2001
Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
Lecture Notes in Computer Science, 2007
Conditionally Verifiable Signature
Lecture Notes in Computer Science, 2006
Security of blind signatures under aborts
Public Key CryptographyPKC 2009, 2009
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
Mark Manulis, Franziskus Kiefer
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13, 2013
On the Generic Construction of Identity-Based Signatures with Additional Properties
2006
Improvement of a Convertible Undeniable Partially Blind Signature Scheme
A pragmatic alternative to undetachable signatures
ACM SIGOPS Operating Systems Review, 2002
Gradually Convertible Undeniable Signatures
Lecture Notes in Computer Science, 2007
Digital signature schemes with strong existential unforgeability
F1000Research
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Lecture Notes in Computer Science, 2010
An Identity-Based Signature Scheme with Bounded Life-Span
Olivier Delos, Jean-jacques Quisquater
Lecture Notes in Computer Science, 1994
A Directed -Threshold Multi-Signature Scheme
Corr, 2004
Extended security arguments for signature schemes
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
Provably Secure Partially Blind Signatures
Advances in Cryptology — CRYPTO 2000, 2000
A note on a signature system based on probabilistic logic
Information Processing Letters, 1980
Efficient generic on-line/off-line (threshold) signatures without key exposure
Information Sciences, 2008
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
2005
Unconditionally Secure Signatures
IACR Cryptol. ePrint Arch., 2016
Forward-Secure Threshold Signature Schemes
Lecture Notes in Computer Science, 2001
The Joint Signature and Encryption Revisited ∗
2013
Provably Secure Convertible Undeniable Signatures with Unambiguity
Lecture Notes in Computer Science, 2010
Short Undeniable Signatures Without Random Oracles: The Missing Link
2005
2021
eprint.iacr.org
Unconditionally Secure Digital Signature Schemes Admitting Transferability
Lecture Notes in Computer Science, 2000
A New Signature Scheme without Random Oracles and Its Applications
2008
Related topics
Digital SignaturePure MathematicsCryptologyZero-Knowledge ProofsNumerical Analysis and Computati...Hash FunctionSignature SchemeData Format
- About
- Press
- Blog
- Papers
- Topics
- We're Hiring!
- Help Center
- Find new research papers in:
- Physics
- Chemistry
- Biology
- Health Sciences
- Ecology
- Earth Sciences
- Cognitive Science
- Mathematics
- Computer Science
- Terms
- Privacy
- Copyright
- Academia ©2024