How to Fix Two RSA-Based PVSS Schemes—Exploration and Solution

  • Kun Peng
  • Matt Henricksen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7372)

Abstract

At ACISP 2011, Peng shows that efficiency of two RSA-based PVSS schemes deteriorates to an intolerable level when practical parameter setting is adopted. In this paper, we show that Peng’s newest PVSS scheme cannot solve the problem. A new PVSS scheme is designed in this paper to fix the problem in the two RSA-based PVSS schemes. It demonstrates that secure and practical PVSS can be designed on the base of RSA encryption.

Keywords

Secret Sharing Fair Exchange Direct Anonymous Attestation Basic Proof Multiplicative Modulus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adida, B., Wikström, D.: How to Shuffle in Public. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 555–574. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes 5(1), 1–9 (2002)Google Scholar
  3. 3.
    Boudot, F., Traoré, J.: Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 87–102. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Chandran, N., Ostrovsky, R., Skeith III, W.E.: Public-Key Encryption with Efficient Amortized Updates. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 17–35. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Damgård, I., Cramer, R.: On Σ-protocols. In: Cryptologic Protocol Theory (2002), http://www.daimi.au.dk/~ivan/Sigma.ps
  6. 6.
    Damgård, I., Thorbek, R.: Non-interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412–429. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS 1987, pp. 427–437 (1987)Google Scholar
  8. 8.
    Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16–30. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32–46. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  10. 10.
    Ge, H., Tate, S.R.: A Direct Anonymous Attestation Scheme for Embedded Devices. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 16–30. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Juels, A., Catalano, D., Jakobsson, M.: Coercion-Resistant Electronic Elections. In: Chaum, D., Jakobsson, M., Rivest, R.L., Ryan, P.Y.A., Benaloh, J., Kutylowski, M., Adida, B. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 37–63. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Kiayias, A., Yung, M.: Tree-Homomorphic Encryption and Scalable Hierarchical Secret-Ballot Elections. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 257–271. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Küpçü, A., Lysyanskaya, A.: Optimistic Fair Exchange with Multiple Arbiters. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 488–507. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Peng, K., Bao, F.: Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy. In: Youm, H.Y., Yung, M. (eds.) WISA 2009. LNCS, vol. 5932, pp. 118–132. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Peng, K.: Impracticality of Efficient PVSS in Real Life Security Standard (Poster). In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 451–455. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  16. 16.
    Saxena, N., Tsudik, G., Yi, J.: Threshold cryptography in p2p and manets: The case of access control. Computer Networks 51(12), 3632–3649 (2007)MATHCrossRefGoogle Scholar
  17. 17.
    Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)Google Scholar
  18. 18.
    Shamir, A.: How to share a secret. Communication of the ACM 22(11), 612–613 (1979)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Stadler, M.A.: Publicly Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Kun Peng
    • 1
  • Matt Henricksen
    • 1
  1. 1.Institute for Infocomm ResearchSingapore

Personalised recommendations