[PDF][PDF] Abstraction in Cryptography.
UM Maurer - CRYPTO, 2009 - iacr.org
Abstraction in Cryptography Page 1 Abstraction in Cryptography Ueli Maurer ETH Zurich
CRYPTO 2009, August 19, 2009 Page 2 Abstraction in Cryptography Ueli Maurer ETH …
CRYPTO 2009, August 19, 2009 Page 2 Abstraction in Cryptography Ueli Maurer ETH …
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
H Chen, R Cramer - Annual International Cryptology Conference, 2006 - Springer
We introduce algebraic geometric techniques in secret sharing and in secure multi-party
computation (MPC) in particular. The main result is a linear secret sharing scheme (LSSS) …
computation (MPC) in particular. The main result is a linear secret sharing scheme (LSSS) …
Secure computation from random error correcting codes
H Chen, R Cramer, S Goldwasser, R De Haan… - … Conference on the …, 2007 - Springer
Secure computation consists of protocols for secure arithmetic: secret values are added and
multiplied securely by networked processors. The striking feature of secure computation is …
multiplied securely by networked processors. The striking feature of secure computation is …
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
This work deals with “MPC-friendly” linear secret sharing schemes (LSSS), a mathematical
primitive upon which secure multi-party computation (MPC) can be based and which was …
primitive upon which secure multi-party computation (MPC) can be based and which was …
Error detection in monotone span programs with application to communication-efficient multi-party computation
Recent improvements in the state-of-the-art of MPC for non-full-threshold access structures
introduced the idea of using a collision-resistant hash functions and redundancy in the …
introduced the idea of using a collision-resistant hash functions and redundancy in the …
Efficient explicit constructions of multipartite secret sharing schemes
Q Chen, C Tang, Z Lin - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …
which the set of participants is divided into several parts and all participants in the same part …
Coset bounds for algebraic geometric codes
IM Duursma, S Park - Finite Fields and Their Applications, 2010 - Elsevier
We develop new coset bounds for algebraic geometric codes. The bounds have a natural
interpretation as an adversary threshold for algebraic geometric secret sharing schemes and …
interpretation as an adversary threshold for algebraic geometric secret sharing schemes and …
Ideal uniform multipartite secret sharing schemes
Q Chen, X Ren, L Hu, Y Cao - Information Sciences, 2024 - Elsevier
Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …
which the set of participants is divided into several parts and all participants in the same part …
Efficient explicit constructions of compartmented secret sharing schemes
Q Chen, C Tang, Z Lin - Designs, Codes and Cryptography, 2019 - Springer
Multipartite secret sharing schemes have been an important object of study in the area of
secret sharing schemes. Two interesting families of multipartite access structures are …
secret sharing schemes. Two interesting families of multipartite access structures are …
Strongly multiplicative hierarchical threshold secret sharing
We consider multi-party computation (MPC) in a hierarchical setting, where participants
have different capabilities depending on their position in the hierarchy. First, we give …
have different capabilities depending on their position in the hierarchy. First, we give …