Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
The unrelated problems in distributed computing, cryptography and complexity theory were discussed. First problem dealt with the selective decommitment in which an adversary was given commitment to a collection of messages and the adversary can ask for some subsets of the commitments to open. Second problem dealt with the power of 3-round weak zero-knowledge arguements which states what can be proved in zero-knowledge in a 3-round arguement. The third problem dealt with the method of converting a 3-round public -coin arguement to a 1-round signature scheme.
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Barry K. Rosen
SWAT 1972
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing