Takeshi Nakai

Orcid: 0000-0002-8181-8968

According to our database1, Takeshi Nakai authored at least 17 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
3
2
3
1
3
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Secure multi-party computation with legally-enforceable fairness.
Int. J. Inf. Sec., December, 2024

Card-based Cryptography with a Standard Deck of Cards, Revisited: Efficient Protocols in the Private Model.
New Gener. Comput., September, 2024

Card-Based Protocols for Private Set Intersection and Union.
New Gener. Comput., September, 2024

2023
Constant-round linear-broadcast secure computation with penalties.
Theor. Comput. Sci., May, 2023

A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners.
Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

Single-Shuffle Card-Based Protocols with Six Cards per Gate.
Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

The Two Sheriffs Problem: Cryptographic Formalization and Generalization.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2022

Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations.
New Gener. Comput., 2022

Efficient Card-Based Majority Voting Protocols.
New Gener. Comput., 2022

An Improvement of Multi-Party Private Set Intersection Based on Oblivious Programmable PRFs.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

Card-based Cryptographic Protocols for Private Set Intersection.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

2021
How to Solve Millionaires' Problem with Two Kinds of Cards.
New Gener. Comput., 2021

Secure Computation with Non-Equivalent Penalties in Constant Rounds.
Proceedings of the 3rd International Conference on Blockchain Economics, 2021

2017
Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations.
Proceedings of the Information Theoretic Security - 10th International Conference, 2017

2016
Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations.
Proceedings of the Cryptology and Network Security - 15th International Conference, 2016


  Loading...