Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств

DOI10.4213/mvk212zbMath1475.94181OpenAlexW2791711992MaRDI QIDQ3381861

No author found.

Publication date: 20 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk212

zbMATH Keywords

linear codesubspace intersectionsecret sharing scheme

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Multi-Party Secure Computation of Multi-Variable Polynomials

Cites Work

• A method for efficiently computing the number of codewords of fixed weights in linear codes
• On near-MDS codes
• Minimum-weight codewords as generators of generalized Reed-Muller codes
• A REVIEW ON OPERATOR QUANTUM ERROR CORRECTION — DEDICATED TO PROFESSOR MIKIO NAKAHARA ON THE OCCASION OF HIS 60TH BIRTHDAY
• How to share a secret
• Generalized Hamming weights for linear codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Linear algebra approach to secret sharing schemes
• Dimension/length profiles and trellis complexity of linear block codes
• Secure Computation from Random Error Correcting Codes
• Wire-Tap Channel II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств