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

Amos Beimel (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITC.2023.16

access: open

type: Conference or Workshop Paper

metadata version: 2023-07-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/citc/Beimel23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/citc/Beimel23
Amos Beimel:
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. ITC 2023: 16:1-16:13

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.