Secret sharing schemes with strong multiplication and a large number of players from toric varieties

DOI10.1090/conm/686/13783zbMath1391.94831arXiv1410.4378OpenAlexW2562140138MaRDI QIDQ5346825

Johan P. Hansen

Publication date: 29 May 2017

Published in: Arithmetic, Geometry, Cryptography and Coding Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.4378

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Calculating the minimum distance of a toric code via algebraic algorithms ⋮ Projective toric codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice polytopes in coding theory
• Coset bounds for algebraic geometric codes
• Duality for some families of correction capability optimized evaluation codes
• On the structure of generalized toric codes
• On toric codes and multivariate Vandermonde matrices
• Toric varieties, Hirzebruch surfaces and error-correcting codes
• Toric codes and finite geometries
• Remarks on generalized toric codes
• On the parameters of \(r\)-dimensional toric codes
• Quantum Codes From Toric Surfaces
• How to share a secret
• Introduction to Toric Varieties. (AM-131)
• The Order Bound for Toric Codes
• Toric Surface Codes and Minkowski Length of Polygons
• Toric Surface Codes and Minkowski Sums
• Secure Computation from Random Error Correcting Codes
• Secure Multiparty Computation and Secret Sharing
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields