On d-Multiplicative Secret Sharing
- 5 February 2010
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 23 (4) , 580-593
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Geometric Approach to Information-Theoretic Private Information RetrievalSIAM Journal on Computing, 2007
- COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONScomputational complexity, 2006
- Secure multi-party computation made simpleDiscrete Applied Mathematics, 2006
- Foundations of Cryptography2004
- Communication Complexity of Simultaneous MessagesSIAM Journal on Computing, 2003
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Privacy and Communication ComplexitySIAM Journal on Discrete Mathematics, 1992
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- Lower bounds on the size of bounded depth circuits over a complete basis with logical additionMathematical Notes, 1987
- How to share a secretCommunications of the ACM, 1979