We show:*

[CGGM]
- rZK proof-systems for NP (with polynomial number of rounds)
- Constant round rWI proof-systems for NP
- Constant round rZK argument for NP in the ìPublic-Key Modelî.

[BFGM] New paradigms and schemes to achieve resettable ID schemes
- Useful for small portable devices (smart-cards).

* Under the existence of commitment schemes

(0f different flavors)

[CGGM]