External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs

Bar Alon, Amos Beimel, Tamar Ben-David, Eran Omri, Anat Paskin-Cherniavsky. New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. IACR Cryptology ePrint Archive, 2024:419, 2024. [doi]

Authors

Bar Alon

This author has not been identified. Look up 'Bar Alon' in Google

Amos Beimel

This author has not been identified. Look up 'Amos Beimel' in Google

Tamar Ben-David

This author has not been identified. Look up 'Tamar Ben-David' in Google

Eran Omri

This author has not been identified. Look up 'Eran Omri' in Google

Anat Paskin-Cherniavsky

This author has not been identified. Look up 'Anat Paskin-Cherniavsky' in Google
runs on