"Compressing Proofs of k-Out-Of-n Partial Knowledge."

Thomas Attema, Ronald Cramer, Serge Fehr (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-84259-8_3

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/crypto/AttemaCF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/AttemaCF21
Thomas Attema, Ronald Cramer, Serge Fehr:
Compressing Proofs of k-Out-Of-n Partial Knowledge. CRYPTO (4) 2021: 65-91

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.