How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we first show a multiple-use OT^n_1 protocol under the Diffie-Hellman assumption such that the initialization phase is much more efficient than the previous one. We next present an efficient multiple-use OT^n_1 protocol whose security is equivalent to breaking RSA. The securities of our OT^n_1 protocols are all formally proved.
- 社団法人電子情報通信学会の論文
- 2004-01-01
著者
-
KUROSAWA Kaoru
Department of Computer and Information Sciences, Ibaraki University
-
Kurosawa Kaoru
Department Of Computer And Information Sciences Ibaraki University
-
Duong Q
Natl. Inst. Of Info. And Com. Tech. Koganei‐shi Jpn
-
DUONG Quang
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Duong Quang
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Kurosawa Kaoru
Department Of Behavioral Sciences Faculty Of Letters Chiba University
関連論文
- On the Security of a MAC by Mitchell(Symmetric Key Cryptography)(Cryptography and Information Security)
- TMAC: Two-Key CBC MAC (Symmetric Cipher) (Cryptography and Information Security)
- TMAC : Two-Key CBC MAC
- Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications)
- A Network Game Based on Fair Random Numbers(Cyberworlds)
- A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(Discrete Mathematics and Its Applications)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (Cryptography and Information Security)
- Hoe to Improve Interpolation Attack(Symmetric Key Cryptography)(Cryptography and Information Security)
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k(Special Section on Cryptography and Information Security)
- Some new results on nonperfect secret sharing schemes
- A.C. Characteristics of the Electroviscous Effect
- Transient Pressure-Drop Fluctuatins in Electroviscous Effect
- Electroviscous Effect in Liquid Crystals
- The Electroviscous Effect in the MBBA Liquid Crystal
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- New bound for affine resolvable designs and its application to authentication codes
- On Parallel Hash Functions Based on Block-Ciphers (Symmetric Cipher) (Cryptography and Information Security)
- Square Hash with a Small Key Size (Symmetric Cipher) (Cryptography and Information Security)
- k-Resilient Identity-Based Encryption in the Standard Model(Public Key Cryptography, Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackott Cipher (Symmetric Cipher) (Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackoff Cipher
- Birthday Paradox for Multi-Collisions
- Practical and Proven Zero-Knowledge Constant Round Variants of GQ and Schnorr (Special Section on Cryptography and Information Security)
- Process interactionism, process analysis, and self process : An extension of Kurt Lewin's approach to personality psychology
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer
- Square Hash with a Small Key Size
- Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions