Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks

  • David Xiao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7785)

Abstract

Several proofs initially presented by the author [2] were shown to be incorrect in a recent work of Ostrovsky et al [1]. In this notice we summarize the errors and summarize the current state of the art after taking into account the errors and subsequent work.

References

  1. 1.
    Ostrovsky, R., Rao, V., Scafuro, A., Visconti, I.: Revisiting Lower and Upper Bounds for Selective Decommitments. Cryptology ePrint Archive, Report 2011/536 (2011), http://eprint.iacr.org/
  2. 2.
    Xiao, D.: (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 541–558. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Xiao, D.: On the round complexity of black-box constructions of commitments secure against selective opening attacks. Technical Report 2009/513, Cryptology ePrint Archive (2012)Google Scholar
  4. 4.
    Xiao, D.: Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 395–411. Springer, Heidelberg (2012)CrossRefGoogle Scholar

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • David Xiao
    • 1
  1. 1.LIAFACNRS and Université Paris DiderotParis 7France

Personalised recommendations