Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
When people want to exchange digital money and digital data over the Internet like a market, privacy for the participant's behavior, security against malicious users and fairness for matching must be assured. We propose a new concept "Matching Oblivious Transfer," which can match valuable digital data with hiding the price suggested by participant and securely deliver the digital data to the matched participant. Then we propose a protocol for some general matching rules in which once a participant sends an order to the market, no interaction between each participant and the market is needed.
- 社団法人電子情報通信学会の論文
- 2003-01-01
著者
-
Ogata Wakaha
Tokyo Inst. Of Technol. Tokyo Jpn
-
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
関連論文
- 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 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
- Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
- 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
- A General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
- Provably Secure On-Line Secret Sharing Scheme
- On Claw Free Families (Special Section on Cryptography and Information Security)
- 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 Simple and Efficient Secret Sharing Scheme Secure against Cheating
- Undeniable and Unpretendable Signatures