A new notion of soundness in bare public-key model

Authors:
Shirley H. C. Cheung;Xiaotie Deng;C. H. Lee;Yunlei Zhao
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Year:
2002

Citing 4
Cited 0

How to construct random functions

Journal of the ACM (JACM)
Resettable zero-knowledge (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Resettably-Sound Zero-Knowledge and its Applications

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.