default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKittiphop Phalakarn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Kittiphop Phalakarn, Toru Nakamura:
Verification Protocol for Stable Matching from Conditional Disclosure of Secrets. ACNS (1) 2024: 119-134- 2023
- [c6]Kittiphop Phalakarn, Toru Nakamura, Takamasa Isohara:
Privacy-Preserving Reputation System Against Dishonest Queries. PST 2023: 1-9 - [i5]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. IACR Cryptol. ePrint Arch. 2023: 1167 (2023) - [i4]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IACR Cryptol. ePrint Arch. 2023: 1168 (2023) - [i3]Kittiphop Phalakarn, Nuttapong Attrapadung, Kanta Matsuura:
Efficient Oblivious Evaluation Protocol and Conditional Disclosure of Secrets for DFA. IACR Cryptol. ePrint Arch. 2023: 1169 (2023) - [i2]Kittiphop Phalakarn, Athasit Surarerks:
Faster cellular automata cryptosystems with neighbor sequences. IACR Cryptol. ePrint Arch. 2023: 1186 (2023) - 2022
- [c5]Kittiphop Phalakarn, Nuttapong Attrapadung, Kanta Matsuura
:
Efficient Oblivious Evaluation Protocol and Conditional Disclosure of Secrets for DFA. ACNS 2022: 605-625 - 2021
- [c4]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IWSEC 2021: 77-96 - 2020
- [c3]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. INDOCRYPT 2020: 763-785
2010 – 2019
- 2018
- [j1]Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn:
Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication. Int. J. Netw. Comput. 8(2): 166-185 (2018) - 2017
- [c2]Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn:
Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication. CANDAR 2017: 482-488 - 2016
- [c1]Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn:
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-Chains. CANDAR 2016: 140-146 - [i1]Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn:
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains. IACR Cryptol. ePrint Arch. 2016: 899 (2016)
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 23:04 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:
