How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A protocol to set up shared secret schemes without the assistance of mutually trusted party
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Fast signature generation with a Fiat Shamir—like scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
A Forward-Secure Digital Signature Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Treshold Cryptosystems (invited talk)
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically)
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
SiBIR: Signer-Base Intrusion-Resilient Signatures
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 11th ACM conference on Computer and communications security
Forward-secure signatures with untrusted update
Proceedings of the 13th ACM conference on Computer and communications security
Optimal resilient threshold GQ signatures
Information Sciences: an International Journal
Forward-secure signatures in untrusted update environments: efficient and generic constructions
Proceedings of the 14th ACM conference on Computer and communications security
Forward Secure Threshold Signature Scheme from Bilinear Pairings
Computational Intelligence and Security
How to Publicly Verifiably Expand a Member without Changing Old Shares in a Secret Sharing Scheme
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
Construction of Yet Another Forward Secure Signature Scheme Using Bilinear Maps
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Strong mobile device protection from loss and capture
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Key Evolution Systems in Untrusted Update Environments
ACM Transactions on Information and System Security (TISSEC)
Forward secure ring signature without random oracles
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Efficient intrusion-resilient signatures without random oracles
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Factoring-based proxy signature schemes with forward-security
CIS'04 Proceedings of the First international conference on Computational and Information Science
Remote authentication with forward security
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Yet another forward secure signature from bilinear pairings
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Adaptively secure forward-secure non-interactive threshold cryptosystems
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Adaptively secure non-interactive threshold cryptosystems
Theoretical Computer Science
| Hi-index | 0.00 |
We construct forward-secure threshold signature schemes. These schemes have the following property: even if more than the threshold number of players are compromised, it is not possible to forge signatures relating to the past. This property is achieved while keeping the public key fix ed and updating the secret keys at regular intervals. The schemes are reasonably efficient in that the amount of secure storage, the signature size and the key lengths do not vary proportionally to the number of time periods during the lifetime of the public key. Both proposed schemes are based on the Bellare-Miner forward-secure signature scheme. One scheme uses multiplicative secret sharing and tolerates mobile eavesdropping adversaries. The other scheme is based on polynomial secret sharing and tolerates mobile halting adversaries. We prove both schemes secure via reduction to the Bellare-Miner scheme, which is known to be secure in the random oracle model assuming that factoring is hard.