Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
RSA-Based Undeniable Signatures for General Moduli
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
RSA-OAEP Is Secure under the RSA Assumption
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Threshold Ring Signatures and Applications to Ad-hoc Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Undeniable Signatures
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Auction Protocol Which Hides Bids of Losers
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
SKEME: a versatile secure key exchange mechanism for Internet
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Securing traceability of ciphertexts: towards a secure software key escrow system
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Invisibility and anonymity of undeniable and confirmer signatures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Anonymity on Paillier's trap-door permutation
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Information Sciences: an International Journal
Universally anonymizable public-key encryption
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
PA in the two-key setting and a generic conversion for encryption with anonymity
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
We say that an encryption scheme or a signature scheme provides anonymity when it is infeasible to determine which user generated a ciphertext or a signature. To construct the schemes with anonymity, it is necessary that the space of ciphertexts or signatures is common to each user. In this paper, we focus on the techniques which can be used to obtain this anonymity property, and propose a new technique for obtaining the anonymity property on RSA-based cryptosystem, which we call “sampling twice.” It generates the uniform distribution over 2k by sampling the two elements from ${\mathbb Z}_N$ where |N| = k. Then, by applying the sampling twice technique, we construct the schemes for encryption, undeniable and confirmer signature, and ring signature, which have some advantage to the previous schemes.