SEARCH

SEARCH BY CITATION

REFERENCES

  • 1
    Katz J, Lindell Y. In Introduction to Modern Cryptography. Chapman and Hall/CRC: Boca Raton, London, New York, 2007.
  • 2
    Agrawal D, Abbadi A, Emekci F, Metwally A. Database management as a service: challenges and opportunities. In IEEE ICDE, 2009.
  • 3
    Yao AC. Protocols for secure computations (extended abstract). In The 21st Annual IEEE Symposium on the Foundations of Computer Science. 1982; 160164.
  • 4
    Cramer R, Damgård I, Nielsen JB. Multiparty computation, an introduction. Lecture notes, 2009. Available http://www.brics.dk/~jbn/smc.pdf.
  • 5
    Stinson D. In Cryptography, Theory and Practice (3rd edition edn). Chapman and Hall/CRC: Boca Raton, London, New York, 2005.
  • 6
    Trappe W, Washington L. In Introduction to Cryptography with Coding Theory (2nd edition edn). Prentice Hall: Upper Saddle River, New Jersey 07458, 2006.
  • 7
    Damgård I. A design principle for hash functions. In Proc. of CRYPTO 1989. LNCS, Vol. 435.
  • 8
    Merkle RC. Secrecy, authentication, and public key systems. PhD Thesis, Stanford University, 1979.
  • 9
    Joux A. Multicollisions in iterated hash functions. Application to cascaded construction. In Proc. of CRYPTO 2004. LNCS, Vol. 3152; 306316.
  • 10
    Kelsey J, Kohno T. Herding hash functions and the Nostradamus attack. Cryptology ePrint Archive, Report 2005/281, 2005.
  • 11
    Stevens M, Lenstra AK, Weger B. Predicting the winner of the 2008 US presidential elections using a Sony PlayStation 3, November 2007. Available online http://www.win.tue.nl/hashclash/Nostradamus.
  • 12
    Shamir A. How to share a secret. Communications of the ACM 1979; 22(11):612613.
  • 13
    Herzberg A, Jarecki S, Krawczyk H, Yung M. Proactive secret sharing. In Proc. of CRYPTO 1995. LNCS, Vol. 963, 1995.
  • 14
    Feldman P. A practical scheme for non-interactive verifiable secret sharing. In Proc. of the 28th IEEE Symposium on the Foundations of Computer Science. 1987; 427437.
  • 15
    Harn L, Lin C. Detection and identification of cheaters in (t, n) secret sharing scheme. Designs, Codes and Cryptography 2009; 52(1):1524.
  • 16
    Zheng Y, Hardjono T, Seberry J. Reusing shares in secret sharing schemes. The Computer Journal 1994; 37(3):199205.
  • 17
    Chum C, Zhang X. Applying hash functions in the Latin square based secret sharing schemes. In Proc. of the 2010 International Conference on Security and Management (SAM'10). 2010; 197203.
  • 18
    Chum C, Zhang X. The Latin squares and the secret sharing schemes. Groups – Complexity – Cryptology 2010; 2:175202.
  • 19
    Iwamoto M, Yamamoto H. Strongly secure ramp secret sharing schemes for general access structures. Journal Information Processing Letters 2006; 97(2):5257.
  • 20
    Kurihara J, Kiyomoto S, Fukushima K, Tanaka T. A fast (k, l, n)-threshold ramp secret sharing scheme. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2009; E92.A(8):18081821.
  • 21
    Benaloh J, Leichter J. Generalized secret sharing and monotone functions. In CRYPTO 1988. LNCS, Vol. 403, 1990; 2735.
  • 22
    Capocelli RM, De Santis A, Gargano L, Vaccaro U. On the size of shares for secret sharing schemes. Journal of Cryptology 1993; 6(3):157167.
  • 23
    Csirmaz L. The size of a share must be large. Journal of Cryptology 1997; 10(4):223231.
  • 24
    Tassa T. Hierarchical threshold secret sharing. Journal of Cryptology 2007; 20(11):237264.
  • 25
    Simmons GJ. How to (really) share a secret. In CRYPTO1988. LNCS, Vol. 403, 1990; 390448.