default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Obana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c36]Kiminori Kaneko, Satoshi Obana:
A Cryptanalysis against the Cheating Detectable Secret Sharing from NISS 2019. candar 2023: 148-154- [c35]Maki Yoshida, Sumio Morioka, Satoshi Obana:
Secure Communication via GNSS-based Key Synchronization. WIPHAL 2023 - 2022
- [c34]Sho Sugauchi, Satoshi Obana:
Fully Subliminal-Free Schnorr Signature for Nonce. CANDAR 2022: 179-185 - [c33]Maki Yoshida, Sumio Morioka
, Satoshi Obana:
On Cryptographic Algorithms and Key Length for Delayed Disclosure Authentication of GNSS. ICL-GNSS 2022: 1-6 - 2021
- [c32]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: 91-100 - [c31]Kaichi Sato, Satoshi Obana:
Cheating Detectable Secret Sharing Scheme from Multiplicative Homomorphic Authentication Function. CANDAR (Workshops) 2021: 372-378 - [c30]Kaito Uemura, Satoshi Obana:
Exposure Resilient Public-key Encryption with Keyword Search against Keyword Guessing Attack. SECRYPT 2021: 692-697 - 2020
- [c29]Satoshi Obana, Maki Yoshida:
Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing. ICETE (2) 2020: 322-329 - [c28]Maki Yoshida, Satoshi Obana:
Compact Verifiably Multiplicative Secret Sharing. ISITA 2020: 437-441
2010 – 2019
- 2019
- [j7]Maki Yoshida, Satoshi Obana:
Verifiably Multiplicative Secret Sharing. IEEE Trans. Inf. Theory 65(5): 3233-3245 (2019) - [c27]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: 86-103 - [c26]Tomoki Agematsu, Satoshi Obana:
Almost Optimal Cheating-Detectable (2, 2, n) Ramp Secret Sharing Scheme. CANDAR 2019: 1-9 - 2018
- [j6]Maki Yoshida, Satoshi Obana:
On the (in)efficiency of non-interactive secure multiparty computation. Des. Codes Cryptogr. 86(8): 1793-1805 (2018) - [j5]Haruna Higo, Toshiyuki Isshiki, Kengo Mori, Satoshi Obana:
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 138-148 (2018) - [c25]Tomoki Agematsu, Satoshi Obana:
How to Realize Highly Accurate Computation with Fully Homomorphic Encryption. CANDAR Workshops 2018: 391-397 - [c24]Motoki Miyano, Satoshi Obana:
Updatable Searchable Symmetric Encryption with Fine-Grained Delete Functionality. CANDAR Workshops 2018: 438-444 - [i4]Maki Yoshida, Satoshi Obana:
Flaws in a Verifiably Multiplicative Secret Sharing Scheme from ICITS 2017. IACR Cryptol. ePrint Arch. 2018: 83 (2018) - 2017
- [c23]Maki Yoshida, Satoshi Obana:
Verifiably Multiplicative Secret Sharing. ICITS 2017: 73-82 - [e1]Satoshi Obana, Koji Chida:
Advances in Information and Computer Security - 12th International Workshop on Security, IWSEC 2017, Hiroshima, Japan, August 30 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10418, Springer 2017, ISBN 978-3-319-64199-7 [contents] - 2016
- [c22]Satoshi Obana, Maki Yoshida:
An Efficient Construction of Non-Interactive Secure Multiparty Computation. CANS 2016: 604-614 - [c21]Takahiro Arai, Satoshi Obana:
A Password-Protected Secret Sharing Based on Kurosawa-Desmedt Hybrid Encryption. CANDAR 2016: 597-603 - [c20]Hidetaka Hoshino, Satoshi Obana:
Cheating Detectable Secret Sharing Scheme Suitable for Implementation. CANDAR 2016: 623-628 - [c19]Avishek Adhikari, Kirill Morozov, Satoshi Obana, Partha Sarathi Roy, Kouichi Sakurai, Rui Xu:
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters. ICITS 2016: 3-23 - [c18]Shunta Nozoe, Satoshi Obana:
Searchable symmetric encryption supporting update. ISITA 2016: 713-717 - 2015
- [c17]Maki Yoshida, Satoshi Obana:
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation. ICISC 2015: 185-193 - [c16]Hidetaka Hoshino, Satoshi Obana:
Almost Optimum Secret Sharing Schemes with Cheating Detection for Random Bit Strings. IWSEC 2015: 213-222 - [c15]Haruna Higo, Toshiyuki Isshiki, Kengo Mori, Satoshi Obana:
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks. SAC 2015: 44-64 - [i3]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: 1115 (2015) - 2014
- [c14]Hiroki Hayashi, Satoshi Obana:
Protocols for evaluating conditional sum on encrypted data. ISITA 2014: 148-152 - [c13]Satoshi Obana, Kazuya Tsuchida:
Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field. IWSEC 2014: 88-97 - 2013
- [c12]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: 171-184 - [i2]Maki Yoshida, Satoshi Obana:
Detection of Cheaters in Non-interactive Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2013: 32 (2013) - 2011
- [c11]Satoshi Obana:
Almost Optimum t-Cheater Identifiable Secret Sharing Schemes. EUROCRYPT 2011: 284-302 - [c10]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: 57-62
2000 – 2009
- 2009
- [c9]Jun Furukawa, Kazue Sako, Satoshi Obana:
IC card-based single sign-on system that remains secure under card analysis. Digital Identity Management 2009: 63-72 - 2007
- [c8]Toshinori Araki, Satoshi Obana:
Flaws in Some Secret Sharing Schemes Against Cheating. ACISP 2007: 122-132 - 2006
- [c7]Satoshi Obana, Toshinori Araki:
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution. ASIACRYPT 2006: 364-379 - 2004
- [c6]Tal Malkin, Satoshi Obana, Moti Yung:
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. EUROCRYPT 2004: 306-322 - [i1]Tal Malkin, Satoshi Obana, Moti Yung:
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. IACR Cryptol. ePrint Arch. 2004: 52 (2004) - 2002
- [c5]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: 16-30 - 2001
- [j4]Satoshi Obana, Kaoru Kurosawa:
Bounds and Combinatorial Structure of Multi-Receiver-Codes. Des. Codes Cryptogr. 22(1): 47-63 (2001) - [j3]Kaoru Kurosawa, Satoshi Obana:
Combinatorial Bounds on Authentication Codes with Arbitration. Des. Codes Cryptogr. 22(3): 265-281 (2001) - 2000
- [j2]Satoshi Obana, Kaoru Kurosawa:
Combinatorial Classification of Optimal Authentication Codes with Arbitration. Des. Codes Cryptogr. 20(3): 281-305 (2000)
1990 – 1999
- 1997
- [c4]Kaoru Kurosawa, Satoshi Obana:
Characterisation of (k, n) Multi-receiver Authentication. ACISP 1997: 204-215 - [c3]Satoshi Obana, Kaoru Kurosawa:
A2-code = Affine resolvable = BIBD. ICICS 1997: 118-129 - 1996
- [j1]Satoshi Obana, Kaoru Kurosawa:
Veto is Impossible in Secret Sharing Schemes. Inf. Process. Lett. 58(6): 293-295 (1996) - 1995
- [c2]Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata:
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. CRYPTO 1995: 410-423 - [c1]Kaoru Kurosawa, Satoshi Obana:
Combinatorial Bounds for Authentication Codes with Arbitration. EUROCRYPT 1995: 289-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
