New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we design and analyze some new and practical (selectively) convertible undeniable signature (SCUS) schemes in both random oracle and standard model, which enjoy several merits over existing schemes in the literature. In particular, we design the first practical RSA-based SCUS schemes secure in the standard model. On the path, we also introduce two moduli RSA assumptions, including the strong twin RSA assumption, which is the RSA symmetry of the strong twin Diffie-Hellman assumption (Eurocrypt08).
- 2010-01-01
著者
-
OGATA Wakaha
Tokyo Institute of Technology
-
PHONG Le
Tokyo Institute of Technology
-
KUROSAWA Kaoru
Ibaraki University
-
Phong Le
Tokyo Inst. Of Technol. Tokyo Jpn
-
Ogata Wakaha
Tokyo Inst. Of Technol. Tokyo Jpn
-
Kurosawa Kaoru
Ibaraki Univ. Hitachi‐shi Jpn
関連論文
- Collision-Based Power Attack for RSA with Small Public Exponent
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
- Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
- Provably Secure On-Line Secret Sharing Scheme
- Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
- Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
- Collision-Based Power Attack for RSA with Small Public Exponent
- Tag-KEM from Set Partial Domain One-Way Permutations
- Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
- Small Secret Key Attack on a Takagi's Variant of RSA
- Security of the Five-Round KASUMI Type Permutation
- General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
- On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme(Cryptography and Information Security)
- Efficient Divisible Voting Scheme(Application)(Cryptography and Information Security)
- Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
- k out of n Oblivious Transfer without Random Oracles (Protocol) (Cryptography and Information Security)
- Relationship between Standard Model Plaintext Awareness and Message Hiding
- A General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
- Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
- Provably Secure On-Line Secret Sharing Scheme
- How to Construct Super-Pseudorandom Permutations with Short Keys(Symmetric Cryptography,Cryptography and Information Security)
- An Electronic Voting Protocol Preserving Voter's Privacy(Applications of Information Security Techniques)
- Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
- k out of n Oblivious Transfer without Random Oracles
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- A Simple and Efficient Secret Sharing Scheme Secure against Cheating
- Undeniable and Unpretendable Signatures