default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs."

Amos Beimel (2023)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2023-02-28

- view
  - electronic edition @ iacr.org (open access)
- export record
  dblp key:
  - journals/iacr/Beimel23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/Beimel23
Amos Beimel:
Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs. IACR Cryptol. ePrint Arch. 2023: 289 (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.