Using a model based on probabilistic functions (PF ), it’s introduced the concept of perfect zero knowledge (PZK ) commitment scheme (CS ) allowing quasigroupic homomorphic commitment (QHC ). Using QHC of +m (modular sum in Zm), application is considered in interactive argument systems (IAS ) for several languages. In four of the examples – generalized nand ( [∧(α)]), string equality ([=(m,α,)]), string inequality ([ =(m,α,)]) and graph threecolourations (G3C) – complexity improvements are obtained, in comparison to other established results. Motivation then arises to define a general framework for PZK -IAS for membership in language with committed alphabet (MLCA), such that the properties of soundness and PZK result from high-level parametrizable aspects. A general simulator is constructed for sequential and (most interestingly) for parallel versions of execution. It therefore becomes easier to conceptualize functionalities of this kind of IAS without the consideration of low level aspects of cryptographic primitives. The constructed framework is able to embrace PZK -CS allowing QHC of functions that are not themselves quasigroupic. Several theoretical considerations are made, namely recognizing a necessary requirements to demand on an eventual PZK -CS allowing QHC of some complete function in a Boolean sense. ∗(E-mail) criptog@criptog.com, (Address) Estacao Correios Miraflores, ap.1021, 1496-701-Alges, Portugal.
[1]
Cynthia Dwork,et al.
2-round zero knowledge and proof auditors
,
2002,
STOC '02.
[2]
Mihir Bellare,et al.
Lecture Notes on Cryptography
,
2001
.
[3]
Silvio Micali,et al.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
,
1991,
JACM.
[4]
E. Wright,et al.
An Introduction to the Theory of Numbers
,
1939
.
[5]
Manuel Blum,et al.
Coin Flipping by Telephone.
,
1981,
CRYPTO 1981.
[6]
Gilles Brassard,et al.
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
,
1986,
27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[7]
Chunming Tang,et al.
The Statistical Zero-knowledge Proof for Blum Integer Based on Discrete Logarithm
,
2003,
IACR Cryptol. ePrint Arch..
[8]
David Chaum,et al.
Minimum Disclosure Proofs of Knowledge
,
1988,
J. Comput. Syst. Sci..
[9]
Oded Goldreich,et al.
Zero-Knowledge twenty years after its invention
,
2002,
Electron. Colloquium Comput. Complex..
[10]
Silvio Micali,et al.
The knowledge complexity of interactive proof-systems
,
1985,
STOC '85.
[11]
Christel Baier,et al.
Validation of Stochastic Systems
,
2004,
Lecture Notes in Computer Science.