Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Electronic Jury Voting Protocols
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Key Escrow System with Warrant Bounds
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Escrow Encryption Systems Visited: Attacks, Analysis and Designs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
CRYPTO '95 Proceedings of the 15th 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
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Addition of ElGamal Plaintexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
New Key Recovery in WAKE Protocol
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Improved Magic Ink Signatures Using Hints
FC '99 Proceedings of the Third International Conference on Financial Cryptography
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Convertible Undeniable Signature Scheme
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Batch verification of validity of bids in homomorphic e-auction
Computer Communications
Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy
Information Security Applications
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Distributed "magic ink" signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient bid validity check in ElGamal-based sealed-bid e-auction
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Secret interest groups (SIGs) in social networks with an implementation on Facebook
Proceedings of the 2010 ACM Symposium on Applied Computing
A novel verifiable dynamic multi-policy secret sharing scheme
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Breaking Pomykala-Barabasz Threshold Proxy Signature Scheme
Fundamenta Informaticae
A general, flexible and efficient proof of inclusion and exclusion
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Short convertible undeniable signature in the standard model
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Verifiable secret sharing with comprehensive and efficient public verification
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Two improved partially blind signature schemes from bilinear pairings
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Linkability of a blind signature scheme and its improved scheme
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
A threshold proxy signature scheme using self-certified public keys
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
The efficient multipurpose convertible undeniable signature scheme
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
On the security of some nonrepudiable threshold proxy signature schemes
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Threshold entrusted undeniable signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
An efficient nonrepudiable threshold proxy signature scheme with known signers
Computer Communications
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Efficient threshold zero-knowledge with applications to user-centric protocols
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Short and efficient convertible undeniable signature schemes without random oracles
Theoretical Computer Science
| Hi-index | 0.00 |
This paper introduces distributed prover protocols. Such a protocol is a proof system in which a polynomially bounded prover is replaced by many provers each having partial information about the witness owned by the original prover. As an application of this concept, it is shown how the signer of undeniable signatures can distribute part of his secret key to n agents such that any k of these can verify a signature. This facility is useful in most applications of undeniable signatures, and as the proposed protocols are practical, the results in this paper makes undeniable signatures more useful. The first part of the paper describes a method for verifiable secret sharing, which allows non-interactive verification of the shares and is as secure as the Shamir secret sharing scheme in the proposed applications.