|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC |
2019-05-17 12:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
How to Decode Erros in Information Theoretic PIR Kaoru Kurosawa, Keito Shibata, Kazuki Ishinari, Ippei Kakurai (Ibaraki Univ.) ISEC2019-5 |
[more] |
ISEC2019-5 pp.15-20 |
ISEC |
2017-05-12 10:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Fully Secure Oblivious Keyword Search Kaoru Kurosawa, Yuuki Nemoto (Ibaraki Univ.) ISEC2017-2 |
Oblivious keyword search (OKS) is a secure two party protocol such that the server has ( Data={(x_i,m_i)} ), and the cli... [more] |
ISEC2017-2 pp.7-14 |
ISEC |
2015-09-04 16:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces (from Eurocrypt 2015) Kaoru Kurosawa (Ibaraki Univ.) ISEC2015-35 |
In this invited talk,
we explain the paper,
``(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Mess... [more] |
ISEC2015-35 p.57 |
ISEC |
2014-09-05 15:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Computer Simulation of Garbled Searchable Symmetric Encryption Scheme Keisuke Sasaki, Kaoru Kurosawa (Ibaraki Univ.) ISEC2014-51 |
In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which ... [more] |
ISEC2014-51 pp.27-34 |
ISEC, IT, WBS |
2014-03-10 13:45 |
Aichi |
Nagoya Univ., Higashiyama Campus |
Computer Simulation of Leakage Resilient IBE and IPE Kazuki Suzurimi (Ibaraki Univ.), Le Trieu Phong (NICT), Kaoru Kurosawa (Ibaraki Univ.) IT2013-69 ISEC2013-98 WBS2013-58 |
[more] |
IT2013-69 ISEC2013-98 WBS2013-58 pp.95-100 |
IT, ISEC, WBS |
2013-03-08 15:10 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
How to Reconstruct dp and dq from Their Fraction Shigeyoshi Imai, Kaoru Kurosawa, Takuma Ogasawara (Ibaraki Univ.) IT2012-105 ISEC2012-123 WBS2012-91 |
In PKCS$\#1$ standard, a redundant tuple$(p, q, d, d_p, d_q, q_p)$ is used as a private key of RSA.For each subset $X$ s... [more] |
IT2012-105 ISEC2012-123 WBS2012-91 pp.271-277 |
IT, ISEC, WBS |
2013-03-08 16:00 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Efficient Strictly CCA-Secure Proxy Re-Encryption Scheme Shota Kanno, Kaoru Kurosawa (Ibaraki Univ.), Goichiro Hanaoka, Takahiro Matsuda (AIST) IT2012-107 ISEC2012-125 WBS2012-93 |
In proxy re-encryption (PRE) schemes, the proxy re-encrypts a ciphertext $C$ for Alice into $C'$ which Bob can decrypt.... [more] |
IT2012-107 ISEC2012-125 WBS2012-93 pp.285-291 |
ISEC, IPSJ-CSEC, SITE, ICSS [detail] |
2009-07-02 13:00 |
Akita |
Akita University |
Simplified Proof for Small Secret Key Attack on RSA and its Extension Noboru Kunihiro (Univ. of Tokyo), Kaoru Kurosawa (Ibaragi Univ.) ISEC2009-15 SITE2009-7 ICSS2009-29 |
[more] |
ISEC2009-15 SITE2009-7 ICSS2009-29 pp.1-6 |
ISEC, LOIS |
2007-11-21 13:55 |
Hyogo |
Kobe University |
Small Secret Key Attack on Takagi's Variant of RSA (Part1) Noboru Kunihiro (Univ. of Electro-Comm.), Kouichi Itoh (Fujitsu Labs), Kaoru Kurosawa (Ibaraki Univ.) ISEC2007-90 OIS2007-62 |
[more] |
ISEC2007-90 OIS2007-62 pp.7-14 |
COMP |
2007-09-20 10:00 |
Aichi |
|
Direct Reduction of String (1,2)-OT to Rabin's OT Kaoru Kurosawa (Ibaraki Univ.), Takeshi Koshiba (Saitama Univ.) COMP2007-32 |
[more] |
COMP2007-32 pp.1-4 |
ISEC |
2007-09-07 11:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
How To Find Many Collisions of 3-Pass HAVAL Kazuhiro Suzuki, Kaoru Kurosawa (Ibaraki Univ.) ISEC2007-79 |
The hash function HAVAL
is a well known Merkle-Damg\r{a}rd hash function such as MD4 and MD5.
It has three variants, $... [more] |
ISEC2007-79 pp.41-48 |
ISEC |
2007-05-18 12:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Birthday Paradox for Multi-Collisions Kazuhiro Suzuki (Ibaraki Univ.), Dongvu Tonien (Uni.y of Wollongong), Kaoru Kurosawa, Koji Toyota (Ibaraki Univ.) ISEC2007-6 |
In this paper, we study multi-collision probability.
For a hash function $H:D \rightarrow R$
with $|R|=n$,
it has be... [more] |
ISEC2007-6 pp.39-44 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|