|
|
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 |
2023-05-17 11:55 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
Card-Based Single-Shuffle Protocols for Secure Multiple-Input AND and XOR Computations (from APKC 2022) Tomoki Kuzuma, Raimu Isuzugawa, Kodai Toyoda (Tohoku Univ), Daiki Miyahara (UEC), Takaaki Mizuki (Tohoku Univ) ISEC2023-6 |
In this invited talk, we introduce the paper ``Card-based Single-shuffle Protocols for Secure Multiple-input AND and XOR... [more] |
ISEC2023-6 p.34 |
ISEC |
2022-05-18 15:10 |
Online |
Online |
[Invited Talk]
A Card-Minimal Three-Input AND Protocol Using Two Shuffles (from COCOON 2021) Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki (Tohoku Univ.), Daiki Miyahara (UEC/AIST), Takaaki Mizuki (Tohoku Univ./AIST) ISEC2022-4 |
In this invited talk, we introduce the paper ``A Card-Minimal Three-Input AND Protocol Using Two Shuffles'' by Raimu Isu... [more] |
ISEC2022-4 p.19 |
ISEC |
2021-05-19 11:05 |
Online |
Online |
[Invited Talk]
Six-Card Finite-Runtime XOR Protocol with Only Random Cut (from APKC 2020) Kodai Toyoda (Tohoku Univ.), Daiki Miyahara (Tohoku Univ./AIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2021-3 |
In this invited talk, we introduce the paper ``Six-Card Finite-Runtime XOR Protocol with Only Random Cut'' by Kodai Toyo... [more] |
ISEC2021-3 p.17 |
ISEC |
2019-05-17 17:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
Five-Card AND Protocol in Committed Format Using Only Practical Shuffles (from APKC 2018) Yuta Abe (Tohoku Univ.), Yu-ichi Hayashi (NAIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2019-11 |
In this invited talk, we introduce the paper ``Five-Card AND Protocol in Committed Format Using Only Practical Shuffles'... [more] |
ISEC2019-11 p.49 |
ISEC |
2017-09-04 12:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Lower Bound on the Number of Shuffles for Commited-Format AND Protocols Daiki Miyahara (Tohoku Univ.), Yu-ichi Hayashi (NAIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2017-43 |
(To be available after the conference date) [more] |
ISEC2017-43 pp.15-22 |
ISEC |
2017-05-12 10:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Note on the Numbers of Cards Required to Make Copied Commitments Daiki Miyahara (Tohoku Univ.), Yu-ichi Hayashi (NAIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2017-3 |
Card-based cryptography performs secure multi-party computation with black and red cards. Usually, a Boolean value is en... [more] |
ISEC2017-3 pp.15-22 |
ISEC |
2016-09-02 09:45 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Note on Secure Execution of Random Bisection Cut Itaru Ueda, Akihiro Nishimura (Tohoku Univ.), Yu-ichi Hayashi (Tohoku Gakuin Univ.), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2016-38 |
Using a deck of cards, we can realize a secure computation. Especially, since a random bisection cut was devised in 2009... [more] |
ISEC2016-38 pp.1-7 |
|
|
|
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]
|