Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben
Designs, Codes and Cryptography
Erschienen in: Designs, Codes and Cryptography 2/2014

01.11.2014

Paillier-based publicly verifiable (non-interactive) secret sharing

verfasst von: Mahabir Prasad Jhanwar, Ayineedi Venkateswarlu, Reihaneh Safavi-Naini

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A verifiable secret sharing is a secret sharing scheme with an untrusted dealer that allows participants to verify validity of their own shares. A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme that allows a third party to verify correctness of the distributed shares. We propose an efficient non-interactive PVSS scheme using Paillier additively homomorphic encryption system, and analyze its security in a model that we define in line with the classic semantic-security definition and offering stronger security compared to the previous models. We reduce security of our PVSS scheme to the well studied decisional composite residuosity assumption in this model.
Vorheriger Artikel Multi-trial Guruswami–Sudan decoding for generalised Reed–Solomon codes
Nächster Artikel List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Abe M., Fehr S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Advances in Cryptology—CRYPTO 2004. Lecture Notes in Computer Science, vol. 3152, pp. 317–334. Springer, Berlin (2004).
2.
Blakley G.: Safeguarding cryptographic keys. AFIPS Natl. Comput. Conf. 48, 313–317 (1979).
3.
Chaum D., Pedersen T.P.: Wallet databases with observers. In: Advances in Cryptology—CRYPTO ’92. Lecture Notes in Computer Science, vol. 740, pp. 89–105. Springer, Berlin (1992).
4.
Chor B., Goldwasser S., Micali S., Awerbuch B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS ’85, pp. 383–395. IEEE Computer Society, Washington (1985).
5.
Damgård I., Jurik M.: A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system. In: Public Key Cryptography—PKC 2001. Lecture Notes in Computer Science, vol. 1992, pp. 119–136. Springer, Berlin (2001).
6.
D’Souza R., Jao D., Mironov I., Pandey O.: Publicly verifiable secret sharing for cloud-based key management. In: INDOCRYPT—2011. Lecture Notes in Computer Science, vol. 7107, pp. 290–309. Springer, Berlin (2011).
7.
Feldman P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS ’87, pp. 427–437. IEEE Computer Society, Washington (1987).
8.
Fiat A., Shamir A.: How to prove yourself: practical solutions to identification and signature problems. In: Advances in Cryptology—CRYPTO ’86. Lecture Notes in Computer Science, vol. 263, pp. 186–194. Springer, Berllin (1986).
9.
Fouque P.A., Poupard G., Stern J.: Sharing decryption in the context of voting or lotteries. In: Financial Cryptography—FC 2000. Lecture Notes in Computer Science, vol. 1962, pp. 90–104. Springer, Berlin (2000).
10.
Fujisaki E., Okamoto T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Advances in Cryptology—EUROCRYPT ’98. Lecture Notes in Computer Science, vol. 1403, pp. 32–46. Springer, Berlin (1998).
11.
Gennaro R., Ishai Y., Kushilevitz E., Rabin T.: The round complexity of verifiable secret sharing and secure multicast. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), vol. 3152, pp. 580–589. ACM, Rochester (2001).
12.
Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984).
13.
Heidarvand S., Villar J.L.: Public verifiability from pairings in secret sharing schemes. In: Selected Areas in Cryptography—SAC 2008. Lecture Notes in Computer Science, vol. 5381, pp. 294–308. Springer, Berlin (2008).
14.
Jhanwar M.P.: A practical (non-interactive) publicly verifiable secret sharing scheme. In: ISPEC—2011. Lecture Notes in Computer Science, vol. 6672, pp. 273–287. Springer, Berlin (2011).
15.
Kaya K., Selçuk A.A.: Threshold cryptography based on Asmuth–Bloom secret sharing. Inf. Sci. 177(19), 4148–4160 (2007).
16.
Micali S.: Fair public-key cryptosystems. In: Advances in Cryptology—CRYPTO 1992. Lecture Notes in Computer Science, vol. 740, pp. 113–138. Springer, Berlin (1993).
17.
Nishide T., Sakurai K.: Distributed Paillier cryptosystem without trusted dealer. In: WISA 2010. Lecture Notes in Computer Science, vol. 6513, pp. 44–60. Springer, Berlin (2010).
18.
Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology—EUROCRYPT ’99. Lecture Notes in Computer Science, vol. 1592, pp. 223–238. Springer, Berlin (1999).
19.
Patra A., Choudhary A., Rabin T., Pandu Rangan C.: (2009) The round complexity of verifiable secret sharing revisited. In: Advances in Cryptology—CRYPTO 2009. Lecture Notes in Computer Science, vol. 5677, pp. 487–504. Springer, Berlin (2009).
20.
Pedersen T.P.: Non-interactive and information-theoretic secure verifiable secret sharing, pp. 129–140. Springer, Berlin (1991).
21.
Ruiz A., Villar J.L.: Publicly verfiable secret sharing from Paillier’s cryptosystem. In: WEWoRC 2005, LNI, vol. 74, pp. 98–108. GI (2005).
22.
Schoenmakers B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Advances in Cryptology—CRYPTO ’99. Lecture Notes in Computer Science, vol. 1666, pp. 148–164. Springer, Berlin (1999).
23.
Shamir A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979).
24.
Shoup V.: Practical threshold signatures. In: Technical Report, IBM Research Report RZ 3121 (1999).
25.
Simoens K., Peeters R., Preneel B.: Increased resilience in threshold cryptography: sharing a secret with devices that cannot store shares. In: Pairing-Based Cryptography—Pairing 2010. Lecture Notes in Computer Science, vol. 6487, pp. 116–135. Springer, Berlin (2010).
26.
Stadler M.: Publicly verifiable secret sharing. In: Advances in Cryptology—EUROCRYPT ’96. Lecture Notes in Computer Science, vol. 1070, pp. 190–199. Springer, Berlin (1996).
Metadaten
Titel
Paillier-based publicly verifiable (non-interactive) secret sharing
verfasst von
Mahabir Prasad Jhanwar
Ayineedi Venkateswarlu
Reihaneh Safavi-Naini
Publikationsdatum
01.11.2014
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 2/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-014-9952-6

Weitere Artikel der Ausgabe 2/2014

Designs, Codes and Cryptography 2/2014 Zur Ausgabe

OriginalPaper

Wiretap lattice codes from number fields with no small norm elements

OriginalPaper

On the arithmetic Walsh coefficients of Boolean functions

OriginalPaper

On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences

OriginalPaper

On the exact number of solutions of certain linearized equations

OriginalPaper

Linear covering codes and error-correcting codes for limited-magnitude errors

OriginalPaper

Connections between Construction D and related constructions of lattices

Premium Partner

    Bildnachweise