Multi-Signature Schemes Secure against Active Insider Attacks (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes the first provably secure multi-signature schemes under the random oracle model. The security of our schemes can be proven in the sense of concrete security in Ref. [13]. The proposed schemes are efficient if the random oracle is replaced by practical hash functions. The essential techniques in our proof of security are the optimal reduction from breaking the corresponding identification to breaking signatures (ID Reduction Technique), and the hierarchical heavy row lemmas used in the concrete reduction from solving the primitive problem to breaking the identification scheme.
- 社団法人電子情報通信学会の論文
- 1999-01-25
著者
関連論文
- E2-A New 128-Bit Block Cipher(Special Section on Cryptography and Information Security)
- Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability (Special Section on Cryptography and Information Security)
- Linear Cryptanalysis of FEAL (Special Section on Cryptography and Information Security)
- Key-Dependency of Linear Probability of RC5 (Special Section on Cryptography and Information Security)
- The Best Linear Expression Search of FEAL (Special Section on Cryptography and Information Security)
- Security and Performance Evaluation of ESIGN and RSA on IC Cards by Using Byte-Unit Modular Algorithms(Fundamental Theories for Communications)
- One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash (Special Section on Cryptography and Information Security)
- Provable Security of Practical Public-Key Encryption Systems
- How to Enhance the Security of Public-Key Encryption at Minimum Cost(Special Section on Cryptography and Information Security)
- Collision Search of a Hash Function by Using Random Mapping (Special Section on Cryptography and Information Security)
- Multi-Signature Schemes Secure against Active Insider Attacks (Special Section on Cryptography and Information Security)
- Security of the Extended Fiat-Shamir Schemes (Special Section on Cryptography and Information Security)
- Practical Escrow Cash Schemes (Special Section on Cryptography and Information Security)
- Threshold Key-Recovery Systems for RSA (Special Section on Cryptography and Information Security)
- Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations (Special Section on Cryptography and Information Security)