1. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37, 156–189 (1988)
2. Brockington, M., Culberson, J.: Camouflaging independent vertex sets in quasi-random graphs. In: Johnson, D., Trick, M. (eds.) Cliques, Coloring and Satisfability, vol. XXVI, pp. 75–88. American Mathematical Society, Providence (1994)
3. Lecture Notes in Computer Science;P. Caballero,2001
4. Lecture Notes in Computer Science;D. Chaum,1987
5. Lecture Notes in Computer Science;Y. Desmedt,2003