Satoshi Obana

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 23

Top Topics

Secure Multiparty Computation

Biometric Authentication

Visual Cryptography

Top Venues

CANDAR Workshops

Publications

Maki Yoshida, Sumio Morioka, Satoshi Obana
Secure Communication via GNSS-based Key Synchronization. WIPHAL (2023)
Kiminori Kaneko, Satoshi Obana
A Cryptanalysis against the Cheating Detectable Secret Sharing from NISS 2019. candar (2023)
Sho Sugauchi, Satoshi Obana
Fully Subliminal-Free Schnorr Signature for Nonce. CANDAR (2022)
Maki Yoshida, Sumio Morioka, Satoshi Obana
On Cryptographic Algorithms and Key Length for Delayed Disclosure Authentication of GNSS. ICL-GNSS (2022)
Kaichi Sato, Satoshi Obana
Cheating Detectable Secret Sharing Scheme from Multiplicative Homomorphic Authentication Function. CANDAR (Workshops) (2021)
Kaito Uemura, Satoshi Obana
Exposure Resilient Public-key Encryption with Keyword Search against Keyword Guessing Attack. SECRYPT (2021)
Hiroto Tamiya, Toshiyuki Isshiki, Kengo Mori, Satoshi Obana, Tetsushi Ohki
Improved Post-quantum-secure Face Template Protection System Based on Packed Homomorphic Encryption. BIOSIG (2021)
Maki Yoshida, Satoshi Obana
Compact Verifiably Multiplicative Secret Sharing. ISITA (2020)
Satoshi Obana, Maki Yoshida
Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing. ICETE (2) (2020)
Haruna Higo, Toshiyuki Isshiki, Masahiro Nara, Satoshi Obana, Toshihiko Okamura, Hiroto Tamiya
Security Requirements for Store-on-Client and Verify-on-Server Secure Biometric Authentication. ETAA@ESORICS (2019)
Maki Yoshida, Satoshi Obana
Verifiably Multiplicative Secret Sharing. IEEE Trans. Inf. Theory 65 (5) (2019)
Tomoki Agematsu, Satoshi Obana
Almost Optimal Cheating-Detectable (2, 2, n) Ramp Secret Sharing Scheme. CANDAR (2019)
Maki Yoshida, Satoshi Obana
On the (in)efficiency of non-interactive secure multiparty computation. Des. Codes Cryptogr. 86 (8) (2018)
Tomoki Agematsu, Satoshi Obana
How to Realize Highly Accurate Computation with Fully Homomorphic Encryption. CANDAR Workshops (2018)
Maki Yoshida, Satoshi Obana
Flaws in a Verifiably Multiplicative Secret Sharing Scheme from ICITS 2017. IACR Cryptol. ePrint Arch. 2018 (2018)
Haruna Higo, Toshiyuki Isshiki, Kengo Mori, Satoshi Obana
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2018)
Motoki Miyano, Satoshi Obana
Updatable Searchable Symmetric Encryption with Fine-Grained Delete Functionality. CANDAR Workshops (2018)
Maki Yoshida, Satoshi Obana
Verifiably Multiplicative Secret Sharing. ICITS (2017)
Hidetaka Hoshino, Satoshi Obana
Cheating Detectable Secret Sharing Scheme Suitable for Implementation. CANDAR (2016)
Satoshi Obana, Maki Yoshida
An Efficient Construction of Non-Interactive Secure Multiparty Computation. CANS (2016)
Takahiro Arai, Satoshi Obana
A Password-Protected Secret Sharing Based on Kurosawa-Desmedt Hybrid Encryption. CANDAR (2016)
Avishek Adhikari, Kirill Morozov, Satoshi Obana, Partha Sarathi Roy, Kouichi Sakurai, Rui Xu
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters. ICITS (2016)
Shunta Nozoe, Satoshi Obana
Searchable symmetric encryption supporting update. ISITA (2016)
Avishek Adhikari, Kirill Morozov, Satoshi Obana, Partha Sarathi Roy, Kouichi Sakurai, Rui Xu
Efficient Threshold Secret Sharing Schemes Secure against Rushing Cheaters. IACR Cryptol. ePrint Arch. 2015 (2015)
Maki Yoshida, Satoshi Obana
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation. ICISC (2015)
Hidetaka Hoshino, Satoshi Obana
Almost Optimum Secret Sharing Schemes with Cheating Detection for Random Bit Strings. IWSEC (2015)
Haruna Higo, Toshiyuki Isshiki, Kengo Mori, Satoshi Obana
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks. SAC (2015)
Hiroki Hayashi, Satoshi Obana
Protocols for evaluating conditional sum on encrypted data. ISITA (2014)
Satoshi Obana, Kazuya Tsuchida
Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field. IWSEC (2014)
Toshiyuki Isshiki, Toshinori Araki, Kengo Mori, Satoshi Obana, Tetsushi Ohki, Shizuo Sakamoto
New Security Definitions for Biometric Authentication with Template Protection: Toward covering more threats against authentication systems. BIOSIG (2013)
Maki Yoshida, Satoshi Obana
Detection of Cheaters in Non-interactive Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2013 (2013)
Satoshi Obana
-Cheater Identifiable Secret Sharing Schemes. EUROCRYPT (2011)
Sumio Morioka, Toshiyuki Isshiki, Satoshi Obana, Yuichi Nakamura, Kazue Sako
Flexible architecture optimization and ASIC implementation of group signature algorithm using a customized HLS methodology. HOST (2011)
Jun Furukawa, Kazue Sako, Satoshi Obana
IC card-based single sign-on system that remains secure under card analysis. Digital Identity Management (2009)
Toshinori Araki, Satoshi Obana
Flaws in Some Secret Sharing Schemes Against Cheating. ACISP (2007)
Satoshi Obana, Toshinori Araki
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution. ASIACRYPT (2006)
Tal Malkin, Satoshi Obana, Moti Yung
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. IACR Cryptol. ePrint Arch. 2004 (2004)
Tal Malkin, Satoshi Obana, Moti Yung
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. EUROCRYPT (2004)
Jun Furukawa, Hiroshi Miyauchi, Kengo Mori, Satoshi Obana, Kazue Sako
An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling. Financial Cryptography (2002)
Satoshi Obana, Kaoru Kurosawa
Bounds and Combinatorial Structure of Multi-Receiver-Codes. Des. Codes Cryptogr. 22 (1) (2001)
Kaoru Kurosawa, Satoshi Obana
Combinatorial Bounds on Authentication Codes with Arbitration. Des. Codes Cryptogr. 22 (3) (2001)
Satoshi Obana, Kaoru Kurosawa
Combinatorial Classification of Optimal Authentication Codes with Arbitration. Des. Codes Cryptogr. 20 (3) (2000)
Satoshi Obana, Kaoru Kurosawa
-code = Affine resolvable = BIBD. ICICS (1997)
Kaoru Kurosawa, Satoshi Obana
Characterisation of (k, n) Multi-receiver Authentication. ACISP (1997)
Satoshi Obana, Kaoru Kurosawa
Veto is Impossible in Secret Sharing Schemes. Inf. Process. Lett. 58 (6) (1996)
Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. CRYPTO (1995)
Kaoru Kurosawa, Satoshi Obana
Combinatorial Bounds for Authentication Codes with Arbitration. EUROCRYPT (1995)