### Abstract

Informally speaking, an instance-hiding pruoj system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(z) but does not reveal the input z to the provers. We show here that a boolean function f has an instance-hiding proof system if and only if it is the characteristic function of a language in NEXP ∩ coNEXP. We formalize the notion of zero-knowledge for instance-hiding proof systems with several provers and show that alI such systems can be made perfect zero-knowledge.

Original language | English (US) |
---|---|

Title of host publication | Advances in Cryptology – CRYPTO 1990, Proceedings |

Publisher | Springer Verlag |

Pages | 326-338 |

Number of pages | 13 |

Volume | 537 LNCS |

ISBN (Print) | 9783540545088 |

State | Published - 1991 |

Event | 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 - Santa Barbara, United States Duration: Aug 11 1990 → Aug 15 1990 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 537 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 |
---|---|

Country | United States |

City | Santa Barbara |

Period | 8/11/90 → 8/15/90 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Advances in Cryptology – CRYPTO 1990, Proceedings*(Vol. 537 LNCS, pp. 326-338). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 537 LNCS). Springer Verlag.

**Hiding instances in zero-knowledge proof systems .** / Beaver, Donald; Feigenbaum, Joan; Shoup, Victor.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Advances in Cryptology – CRYPTO 1990, Proceedings.*vol. 537 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 537 LNCS, Springer Verlag, pp. 326-338, 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990, Santa Barbara, United States, 8/11/90.

}

TY - GEN

T1 - Hiding instances in zero-knowledge proof systems

AU - Beaver, Donald

AU - Feigenbaum, Joan

AU - Shoup, Victor

PY - 1991

Y1 - 1991

N2 - Informally speaking, an instance-hiding pruoj system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(z) but does not reveal the input z to the provers. We show here that a boolean function f has an instance-hiding proof system if and only if it is the characteristic function of a language in NEXP ∩ coNEXP. We formalize the notion of zero-knowledge for instance-hiding proof systems with several provers and show that alI such systems can be made perfect zero-knowledge.

AB - Informally speaking, an instance-hiding pruoj system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(z) but does not reveal the input z to the provers. We show here that a boolean function f has an instance-hiding proof system if and only if it is the characteristic function of a language in NEXP ∩ coNEXP. We formalize the notion of zero-knowledge for instance-hiding proof systems with several provers and show that alI such systems can be made perfect zero-knowledge.

UR - http://www.scopus.com/inward/record.url?scp=84958948483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958948483&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540545088

VL - 537 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 326

EP - 338

BT - Advances in Cryptology – CRYPTO 1990, Proceedings

PB - Springer Verlag

ER -