The combinatorics of generalised cumulative arrays

DOI10.1515/JMC.2007.002zbMath1203.68118OpenAlexW2117711438MaRDI QIDQ5443560

Siaw-Lynn Ng

Publication date: 21 February 2008

Published in: Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2007.002

zbMATH Keywords

combinatoricsBoolean functionsdistributed computationgeneralised cumulative arrays

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Anonymity in shared symmetric key primitives ⋮ An unequal probability scheme for improving anonymity in shared key operations

Cites Work

• Unnamed Item
• Unnamed Item
• Some improved bounds on the information rate of perfect secret sharing schemes
• Multiple assignment scheme for sharing secret
• Distributing the encryption and decryption of a block cipher
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Explicit constructions of perfect hash families from algebraic curves over finite fields

This page was built for publication: The combinatorics of generalised cumulative arrays