易改变 发表于 2025-3-30 11:24:01

Matthias Bernhard,Christian Wesselskyecent years, ranging from basic secure computations, such as secure AND and XOR evaluations, to more complex tasks, such as Yao’s Millionaires’ problem and zero-knowledge proof. In this paper, we propose a card-based “secure sorting” protocol; although sorting is probably the most fundamental proble
页: 1 2 3 4 5 [6]
查看完整版本: Titlebook: Advances in Information and Computer Security; 17th International W Chen-Mou Cheng,Mitsuaki Akiyama Conference proceedings 2022 The Editor(