"Zero-knowledge proofs for set membership: efficient, succinct, modular."

Daniel Benarroch et al. (2023)

> Home

Details and statistics

DOI: 10.1007/S10623-023-01245-1

access: open

type: Journal Article

metadata version: 2024-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcc/BenarrochCFGK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/BenarrochCFGK23
Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos:
Zero-knowledge proofs for set membership: efficient, succinct, modular. Des. Codes Cryptogr. 91(11): 3457-3525 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.