On Claw Free Families (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
This paper points out that there are two types of claw free families with respect to a level of claw freeness. We formulate them as weak claw free families and strong claw free families. Then, we present sufficient conditions for each type of claw free families. (A similar result is known for weak claw free families.) They are represented as some algebraic forms of one way functions. A new example of strong claw free families is also given.
- 社団法人電子情報通信学会の論文
- 1994-01-25
著者
-
KUROSAWA Kaoru
Faculty of Engineering, Tokyo Institute of Technology
-
Ogata Wakaha
Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology
-
Ogata Wakaha
Faculty Of Engineering Tokyo Institute Of Technology
-
Ogata Wakaha
Faculty Of Engineering Himeji Institute Of Technology
-
Ogata Wakaha
Himeji Institute Of Technology
-
Kurosawa Kaoru
Faculty Of Engineering Tokyo Institute Of Technology
関連論文
- Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
- Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
- Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
- New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
- Collision-Based Power Attack for RSA with Small Public Exponent
- Attack on Yagisawa Cryptosystem (Special Section on Cryptography and Information Security)
- Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
- Towards Secure and Fast Hash Functions
- 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)
- Some new results on nonperfect secret sharing schemes
- 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)
- 4-Move Perfect ZKIP for Some Promise Problems
- Relationship between Standard Model Plaintext Awareness and Message Hiding
- Provably Secure On-Line Secret Sharing Scheme
- On Claw Free Families (Special Section on Cryptography and Information Security)
- New ElGamal Type Threshold Digital Signature Scheme (Special Section on Cryptography and Information Security)
- Authentication Codes Based on Association Schemes
- Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
- k out of n Oblivious Transfer without Random Oracles
- On the Practical Secret Sharing Scheme : Special Section on Cryptography and Information Security
- Reshufflable and Laziness Tolerant Mental Card Game Protocol (Special Section on Cryptography and Information Security)
- A Key Distribution Protocol for Mobile Communication Systems
- A Simple and Efficient Secret Sharing Scheme Secure against Cheating