Secret sharing homomorphisms: Keeping shares of a secret secret (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 263 LNCS, Issue , 1987, Pages 251-260

  Benaloh, Josh Cohen ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIRECT COMPUTATIONS; EXTENDED ABSTRACTS; FAULT-TOLERANT METHOD; SECRET SHARING; SECRET SHARING SCHEMES; VERIFIABLE SECRET SHARING;

CRYPTOGRAPHY;

EID: 85034837254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47721-7_19     Document Type: Conference Paper

References (17)

1. Adleman, L. “Subexponential Algorithm for The Discrete Logarithm Problem.” Proc.20thIEEE Symp. on Foundations of Computer Science, San Juan, PR (Oct. 1979), 55–60.
2. Asmuth, C. and Bloom, J. “A Modular Approach to Key Safeguarding.” Texas A&M University, Departement of Mathematics, College Station, TX (1980).
3. Benaloh, J. and Yung, M. “Distributing the Power of a Government to Enhance the Privacy of Voters.” Proc. 5thACM Symp. on Principles of Distributed Computing, Calgary, AB (Aug. 1986).
4. Blakley, G. “Safeguarding Cryptographic Keys.” Proc. AFIPS 1979 National Computer Conference, New York, NY (June 1979), 313–317.
5. Blakley, G. and Meadows, C. “A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data.” Proc. IEEE Symposium on Computer Security and Privacy, Oakland, CA (Apr. 1985).
6. Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.” Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 383–395.
7. Cohen, J. and Fischer, M. “A Robust and Verifiable Cryptographically Secure Election Scheme.” Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372–382.
8. Cohen, J. “Improving Privacy in Cryptographic Elections.” TR-454, Yale University, Departement of Computer Science, New Haven, CT (Feb. 1986).
9. Coppersmith, D., Odlyzko, A., and Schroeppel, R. “Discrete Logarithms in GF(p).” Algorithmica, 1 (1986), 1–15.
10. DeMillo, R., Lynch, N., and Merritt, M. “Cryptographic Protocols.” Proc. 14thACM Symp. on Theory of Computing, San Francisco, CA (May 1982), 383–400.
11. Feigenbaum, J. “Encrypting Problem Instances or Can You Take Advantage of Someone Without Having to Trust Him”, Proc. Crypto’ 85, Santa Barbara, CA (Aug. 1985), 477–488. Published as Advances in Cryptology, ed. by H. Williams in Lecture Notes in Computer Science, vol. 218, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).
12. Fischer, M., Micali, S., and Rackoff, C. “A Secure Protocol for the Oblivious Transfer.” Presented at Eurocrypt84, Paris, France (Apr. 1984). (Not in proceedings.)
13. Goldwasser, S., Micali, S., and Rackoff C. “The Knowledge of Complexity of Interactive Proof-Systems.” Proc. 17thACM Symp. on Theory of Computing, Providence, RI (May 1985), 291–304.
14. Goldwasser, S. and Micali, S. “Probabilistic Encryption.” J. Comput. System Sci. 28, (1984), 270–299.
15. Kothari, S. “Generalized Linear Threshold Scheme.” Proc. Crypto’ 84, Santa Barbara, CA (Aug. 1984), 231–241. Published as Advances in Cryptology, ed. by G. Blakely and D. Chaum in Lecture Notes in Computer Science, vol. 196, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).
16. Pohlig, S. and Hellman, M. “An Improved Algorithm for Computing Logarithms Over GF(2) and Its Cryptographic Significance.” IEEE Trans. on Information Theory 24,1 (Jan. 1978), 106–110.
17. Rivest, R., Adleman, L., and Dertouzos, M. “On Data Banks and Privacy Homomorphisms.” Foundations of Secure Computation, ed. by R. A. DeMillo, et al. Academic Press, New York (1978), 169–179.