{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:32:55Z","timestamp":1778297575486,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_19","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"174-187","source":"Crossref","is-referenced-by-count":698,"title":["Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","first-page":"25","volume-title":"Proc. of Crypto 88","author":"J. Benaloh","year":"1988","unstructured":"J. Benaloh and J. Leichter: Generalized Secret Sharing and Monotone Functions, Proc. of Crypto 88, Springer Verlag LNCS series, 25\u201335."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of EuroCrypt 91","author":"D. Chaum","year":"1991","unstructured":"D. Chaum and E. van Heyst: Group Signatures, Proc. of EuroCrypt 91, Springer Verlag LNCS series."},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Crypto 93","author":"I. Damg\u00e5rd","year":"1993","unstructured":"I. Damg\u00e5rd: Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Complexity Assumptions, Proc. of Crypto 93, Springer Verlag LNCS series."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir: Witness Indistinguishable and Witness Hiding Protocols, Proc. of STOC 90.","DOI":"10.1145\/100216.100272"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat and A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology 1 (1988) 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Crypto 88","author":"M. Abadi","year":"1988","unstructured":"M. Abadi, E. Allender, A. Broder, J. Feigenbaum and L. Hemachandra: On Generating Solved Instances of Computational Problems, Proc. of Crypto 88, Springer Verlag LNCS series."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computing 18 (1989) 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of EuroCrypt 88","author":"L. Guillou","year":"1988","unstructured":"L. Guillou and J.-J. Quisquater: A Practical Zero-Knowledge Protocol fitted to Security Microprocessor Minimizing both Transmission and Memory, Proc. of EuroCrypt 88, Springer Verlag LNCS series."},{"key":"19_CR9","unstructured":"M. Ito, A. Saito, and T. Nishizeki: Secret Sharing Scheme Realizing any Access Structure, Proc. Glob.Com. (1987)."},{"key":"19_CR10","unstructured":"T. Pedersen: A Threshold Cryptosystem without a Trusted Third Party, Proc. of EuroCrypt 91."},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Crypto 93","author":"A. Santis De","year":"1993","unstructured":"A. De Santis, G. Di Crescenzo and G. Persiano: Secret Sharing and Perfect Zero-Knowledge, Proc. of Crypto 93, Springer Verlag LNCS series."},{"key":"19_CR12","unstructured":"A. De Santis, G. Persiano, M. Yung: Formulae over Random Self-Reducible Languages: The Extended Power of Perfect Zero-Knowledge, manuscript."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr: Efficient Signature Generation by Smart Cards, Journal of Cryptology 4 (1991) 161\u2013174.","journal-title":"Journal of Cryptology"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir: How to Share a Secret, Communications of the ACM 22 (1979) 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"19_CR15","first-page":"71","volume":"1","author":"G.J. Simmons","year":"1991","unstructured":"G.J. Simmons, W.A. Jackson and K. Martin: The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Applications 1 (1991) 71\u201388.","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:10Z","timestamp":1605647770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_19","relation":{},"subject":[]}}