default search action
Seiko Arita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j7]Seiko Arita, Sari Handa:
Fully Homomorphic Encryption Scheme Based on Decomposition Ring. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 195-211 (2020)
2010 – 2019
- 2018
- [c15]Hiroaki Anada, Seiko Arita:
Witness-Indistinguishable Arguments with ∑-Protocols for Bundled Witness Spaces and Its Application to Global Identities. ICICS 2018: 530-547 - [i7]Hiroaki Anada, Seiko Arita:
Witness-Indistinguishable Arguments with Σ-Protocols for Bundled Witness Spaces and its Application to Global Identities. IACR Cryptol. ePrint Arch. 2018: 742 (2018) - 2017
- [c14]Seiko Arita, Sari Handa:
Subring Homomorphic Encryption. ICISC 2017: 112-136 - [c13]Hiroaki Anada, Seiko Arita:
Anonymous Authentication Scheme with Decentralized Multi-Authorities. SMARTCOMP 2017: 1-6 - [c12]Hiroaki Anada, Seiko Arita:
Short CCA-Secure Ciphertext-Policy Attribute-Based Encryption. SMARTCOMP 2017: 1-6 - [c11]Seiko Arita, Shunji Kozaki:
A Homomorphic Signature Scheme for Quadratic Polynomials. SMARTCOMP 2017: 1-6 - [c10]Seiko Arita, Shota Nakasato:
Fully Homomorphic Encryption for Classification in Machine Learning. SMARTCOMP 2017: 1-4 - [i6]Seiko Arita, Sari Handa:
Subring Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2017: 66 (2017) - [i5]Hiroaki Anada, Seiko Arita:
Short CCA-Secure Ciphertext-Policy Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2017: 469 (2017) - 2016
- [c9]Seiko Arita, Shota Nakasato:
Fully Homomorphic Encryption for Point Numbers. Inscrypt 2016: 253-270 - [i4]Seiko Arita, Shota Nakasato:
Fully Homomorphic Encryption for Point Numbers. IACR Cryptol. ePrint Arch. 2016: 402 (2016) - [i3]Hiroaki Anada, Seiko Arita, Kouichi Sakurai:
Proof of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures. IACR Cryptol. ePrint Arch. 2016: 483 (2016) - 2015
- [c8]Hiroaki Anada, Seiko Arita, Kouichi Sakurai:
Attribute-Based Two-Tier Signatures: Definition and Construction. ICISC 2015: 36-49 - 2014
- [j6]Hiroaki Anada, Seiko Arita, Sari Handa, Yosuke Iwabuchi:
Attribute-Based Identification: Definitions and Efficient Constructions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(5): 1086-1102 (2014) - [c7]Seiko Arita, Sari Handa:
Two applications of multilinear maps: group key exchange and witness encryption. AsiaPKC@AsiaCCS 2014: 13-22 - [c6]Hiroaki Anada, Seiko Arita, Kouichi Sakurai:
Attribute-based signatures without pairings via the fiat-shamir paradigm. AsiaPKC@AsiaCCS 2014: 49-58 - 2013
- [c5]Hiroaki Anada, Seiko Arita, Sari Handa, Yosuke Iwabuchi:
Attribute-Based Identification: Definitions and Efficient Constructions. ACISP 2013: 168-186 - 2012
- [j5]Hiroaki Anada, Seiko Arita:
Identification Schemes from Key Encapsulation Mechanisms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(7): 1136-1155 (2012) - [j4]Seiko Arita:
A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(8): 1390-1401 (2012) - [c4]Seiko Arita:
Flexible Attribute-Based Encryption. ICICS 2012: 471-478 - 2011
- [j3]Seiko Arita:
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 367-382 (2011) - [c3]Hiroaki Anada, Seiko Arita:
Identification Schemes from Key Encapsulation Mechanisms. AFRICACRYPT 2011: 59-76 - [i2]Seiko Arita:
A constant-round resettably-sound resettable zero-knowledge argument in the BPK model. IACR Cryptol. ePrint Arch. 2011: 404 (2011) - 2010
- [c2]Hiroaki Anada, Seiko Arita:
Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks. ProvSec 2010: 18-34
2000 – 2009
- 2009
- [c1]Seiko Arita, Koji Tsurudome:
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions. ACNS 2009: 186-200 - [i1]Seiko Arita:
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme. IACR Cryptol. ePrint Arch. 2009: 527 (2009) - 2007
- [j2]Seiko Arita:
A Straight-Line Extractable Non-malleable Commitment Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(7): 1384-1394 (2007) - [j1]Seiko Arita, Natsumi Kawashima:
An Identification Scheme with Tight Reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1949-1955 (2007)
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-04-24 22:47 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: