Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of arithmetic secret sharing

From MaRDI portal
Publication:2119090
Jump to:navigation, search

DOI10.1007/978-3-030-64381-2_16zbMath1485.94135OpenAlexW3116975629MaRDI QIDQ2119090

Chen Yuan, Ronald Cramer, Xing, Chaoping

Publication date: 23 March 2022

Full work available at URL: https://ir.cwi.nl/pub/30438


zbMATH Keywords

coding theoryarithmetic secret sharing schemes


Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)


Related Items (1)

Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)






This page was built for publication: On the complexity of arithmetic secret sharing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2119090&oldid=14616694"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki