English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In the bare public-key model, introduced by Canetti et al. (STOC 2000), it is only assumed that each verier deposits during a set- up phase a public key in a le accessible by all users at all times. As pointed out by Micali and Reyzin (Crypto 2001), the notion of soundness in this model is more subtle and complex than in the classical model. In- deed Micali and Reyzin have introduced four dieren t notions which are called (from weaker to stronger): one-time, sequential, concurrent and resettable soundness. In this paper we introduce the counter public-key model (the cPK model for short), an augmentation of the bare public-key model in which each verier is equipped with a counter and, like in the original bare public-key model, the key of the verier can be used for any polynomial number of interactions with provers. In the cPK model, we give a three-round concurrently-sound resettable zero-knowledge argu- ment of membership for NP. Previously similar results were obtained by Micali and Reyzin (EuroCrypt 2001) and then improved by Zhao et al. (EuroCrypt 2003) in models in which, roughly speaking, each verier is still equipped with a counter, but the key of the verier could only be used for a xed number of interactions.

Improved Setup Assumptions for 3-Round Resettable Zero Knowledge