Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Card-Based Secure Evaluation of Decision Trees

Yoshifumi Manabe, Naoki Kobayashi

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-89350-6_2

Related papers

Implementation of Classical Decision Trees in a Quantum Computing Paradigm

Manuel Pegalájar Cuéllar, L. G. B. Ruiz, M. C. Pegalajar

Lecture notes in computer science•Oct 8, 2024•2 citations

Quantum decision tree classifier

Songfeng Lu, Samuel L. Braunstein

Quantum Information Processing•Nov 18, 2013•125 citations

Complexity measures and decision tree complexity: a survey

Harry Buhrman, Ronald de Wolf

Theoretical Computer Science•Oct 1, 2002•707 citations

On the Power of Parity Queries in Boolean Decision Trees

Raghav Kulkarni, Youming Qiao, Xiaoming Sun

Lecture notes in computer science•Jan 1, 2015•1 citation

Constant-Round Fair SS-4PC for Private Decision Tree Evaluation

Hikaru Tsuchida, Takashi Nishide

Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 8, 2022•0 citations

Card-Based Secure Ranking Computations

Ken Takashima, Yuta Abe, Tatsuya Sasaki +4 more

Lecture notes in computer science•Jan 1, 2019•9 citations
Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.