Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context

[Sim84] introduced the concept of subliminal channel in the context of signature systems. [Des88b] presented a solution against subliminal channels and extended in [Des88a] the solution to abuse-free coin-flipping, abuse-free generation of public keys, and abuse-free zero-knowledge. In this paper we demonstrate that a whole family of systems (generalized Arthur-Merlin games) can be made abuse-free, avoiding the exhaustive approach of [Des88a]. We will hereto formalize the concept of abuse.

[1]  David Chaum,et al.  Demonstrating Possession of a Discrete Logarithm Without Revealing It , 1986, CRYPTO.

[2]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[3]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[4]  Simmons,et al.  The Subliminal Channel and Digital Signatures , 2022 .

[5]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[7]  Gustavus J. Simmons,et al.  A Secure Subliminal Channel (?) , 1985, CRYPTO.

[8]  Jennifer Seberry,et al.  Authentication without secrecy , 1986 .

[9]  Yvo Desmedt,et al.  Abuses in Cryptography and How to Fight Them , 1988, CRYPTO.

[10]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[11]  Manuel Blum,et al.  Non-interactive zero-knowledge and its applications , 1988, STOC '88.

[12]  Yvo Desmedt Subliminal-Free Authentication and Signature (Extended Abstract) , 1988, EUROCRYPT.

[13]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[14]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[15]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..