A New Notion of Soundness in Bare Public-Key Model
A new notion of soundness in bare public-key (BPK) model is presented. This new notion just lies in between one-time soundness and sequential soundness and its reasonableness is justified in the context of resettable zero-knowledge when resettable zero-knowledge prover is implemented by smart card.
KeywordsSmart Card Security Parameter False Statement Common Input Pseudorandom Function
Unable to display preview. Download preview PDF.
- 1.Boaz Barak, Oded Goldreich, Shafi Goldwasser, and Yehuda Lindell. Resettably-Sound Zero-Knowledge and its Applications. In IEEE Symposium on Foundations of Computer Science, pages 116–125, 2001.Google Scholar
- 3.Ran Canetti, Oded Goldreich, Shafi Goldwasser, and Silvio Micali. Resettable Zero-Knowledge. STOC 2000, pages 235–244, 2000. Available from http://www.wisdom.weizmann.ac.il/~oded/.
- 4.Ran Canetti, Joe Kilian, Erez Petrank, and Alon Rosen. Black-box Concurrent Zeroknowledge Requires Ω (log n) Rounds. In ACM Symposium on Theory of Computing (33rd STOC 2001), pages 570–579, 2001.Google Scholar