Linear integer secret sharing and distributed exponentiation

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

Volumn 3958 LNCS, Issue , 2006, Pages 75-90

  Damgård, Ivan ^a   Thorbck, Rune ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; NETWORK PROTOCOLS; SECURITY OF DATA;

DISTRIBUTED PROTOCOL; EXPONENTIATION; LINEAR INTEGER SECRET-SHARING (LISS);

PUBLIC KEY CRYPTOGRAPHY;

EID: 33745808735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_6     Document Type: Conference Paper

References (23)

1. Josh Cohen Benaloh, Jerry Leichter: Generalized Secret Sharing and Monotone Functions. Proc. of CRYPTO 1988: 27-35
2. R. B. Boppana: Amplification of Probabilistic Boolean Formulas. Advances in Computing Research 5: 27-45 (1989)
3. Jaikumar Radhakrishnan: Better Lower Bounds for Monotone Threshold Formulas. J. Comput. Syst. Sci. 54(2): 221-226 (1997)
4. Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols, FOGS 2001: 136-145.
5. Benny Chor and Eyal Kushilevitz: Secret Sharing Over Infinite Domains., J. Cryptology 6(2): 87-95 (1993)
6. Benny Chor, Mihály Geréb-Graus and Eyal Kushilevitz Private Computations over the Integers., SIAM J. Comput. 24(2): 376-386 (1995)
7. Cramer and Damgård: Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation, Proc. of TCC 04, Springer Verlag LNCS.
8. Ronald Cramer, Serge Fehr: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. Proc. of CRYPTO 2002: 272-287
9. Cramer, Fehr and Stam: Black-Box Secret Sharing from Primitve Sets in Algebraic Number Fields, Proc. of Crypto 05, Springer Verlag LNCS.
10. Ivan Damgård, Kasper Dupont: Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. Proc. of Public Key Cryptography 2005: 346-361
11. Damgård, Fazio and Nicolosi: Non-Interactive Zero-Knowledge Proofs from Homomorphic Encryption Proc. of TCC 06, Springer Verlag LNCS.
12. Ivan Damgård, Maciej Koprowski: Practical Threshold RSA Signatures without a Trusted Dealer. Proc. of EUROCRYPT 2001: 152-165
13. Yvo Desmedt, Yair Frankel: Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group. SIAM J. Discrete Math. 7(4): 667-679 (1994)
14. Ivan Damgård and Rune Thorbek: Linear Integer Secret Sharing and Distributed Exponentiation (full version), the Eprint archive, www.iacr.org
15. Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Optimal Resilience Proactive Public-Key Cryptosystems. FOGS 1997: 384-393
16. Rosario Gennaro, Tal Rabin, Stanislaw Jarecki, and Hugo Krawczyk: Robust and Efficient Sharing of RSA Functions. J. Cryptology 2000 13(2): 273-300
17. Oded Goldreich, Silvio Micali, Avi Wigderson: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems 3. ACM 38(3): 691-729 (1991).
18. Tal Rabin: A Simplified Approach to Threshold and Proactive RSA. Proc. of CRYPTO 1998: 89-104
19. Claus-Peter Schnorr: Efficient Signature Generation by Smart Cards. J. Cryptology 4(3): 161-174 (1991)
20. Adi Shamir: How to Share a Secret. Commun. ACM 22(11): 612-613 (1979)
21. Alfrede De Santis, Yvo Desmedt, Yair Frankel, Moti Yung: How to share a function securely. STOC 1994: 522-533
22. Victor Shoup: Practical Threshold Signatures. Proc. of EUROCRYPT 2000: 207-220
23. Leslie G. Valiant: Short Monotone Formulae for the Majority Function. J. Algorithms 5(3): 363-366 (1984)