Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
- 1 December 2000
- book chapter
- Published by Springer Nature
- p. 251-260
- https://doi.org/10.1007/3-540-47721-7_19
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Encrypting Problem InstancesPublished by Springer Nature ,2000
- Discrete logarithms inGF(p)Algorithmica, 1986
- Distributing the power of a government to enhance the privacy of votersPublished by Association for Computing Machinery (ACM) ,1986
- A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted DataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A robust and verifiable cryptographically secure election schemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Cryptographic protocolsPublished by Association for Computing Machinery (ACM) ,1982
- Safeguarding cryptographic keysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979