Secret sharing technique with low overhead information content

Details Secret sharing technique with low overhead information content Secret sharing technique with low overhead information content

2006-05-03

2011-11-15

Colin, Carl (Department: 2493)

Cryptography

Communication system using cryptography

C380S259000, C380S277000, C380S278000, C380S279000, C380S282000, C713S150000, C713S171000

Reexamination Certificate

active

08059816

ABSTRACT:
An apparatus and method for sharing a secret comprising the steps of generating a first random matrix, generating a first projection matrix from the first random matrix, and determining a first remainder matrix from the first projection matrix and the first secret matrix. The first secret matrix may be determined using the remainder matrix and a plurality of distributed vector shares.

REFERENCES:
patent: 5263085 (1993-11-01), Shamir
patent: 5583939 (1996-12-01), Chang et al.
patent: 5708714 (1998-01-01), Lopez et al.
patent: 5764767 (1998-06-01), Beimel et al.
patent: 5835592 (1998-11-01), Chang et al.
patent: 5966444 (1999-10-01), Yuan et al.
patent: 6088454 (2000-07-01), Nagashima et al.
patent: 6182214 (2001-01-01), Hardjono
patent: 6477254 (2002-11-01), Miyazaki et al.
patent: 6788788 (2004-09-01), Kasahara et al.
patent: 6810122 (2004-10-01), Miyazaki et al.
patent: 6901145 (2005-05-01), Bohannon et al.
patent: 6975760 (2005-12-01), Suga
patent: 6996724 (2006-02-01), Murakami et al.
patent: 7065210 (2006-06-01), Tsujii et al.
patent: 7080255 (2006-07-01), Kasahara et al.
patent: 7136489 (2006-11-01), Madhusudhana et al.
patent: 7158636 (2007-01-01), Ding
patent: 7167565 (2007-01-01), Rajasekaran
patent: 7184551 (2007-02-01), Slavin
patent: 7346162 (2008-03-01), Slavin
patent: 7421080 (2008-09-01), Matsumura et al.
patent: 7472105 (2008-12-01), Staddon et al.
patent: 7551740 (2009-06-01), Lee et al.
patent: 7590236 (2009-09-01), Boneh et al.
patent: 7609839 (2009-10-01), Watanabe et al.
patent: 7634091 (2009-12-01), Zhou et al.
patent: 7653197 (2010-01-01), Van Dijk
patent: 7787619 (2010-08-01), Nadooshan et al.
patent: 7971064 (2011-06-01), Yi et al.
patent: 2003/0026432 (2003-02-01), Woodward
patent: 2003/0210781 (2003-11-01), Mihaljevic et al.
patent: 2003/0215089 (2003-11-01), Mihaljevic et al.
patent: 2003/0221131 (2003-11-01), Mori et al.
patent: 2004/0047472 (2004-03-01), Eskicioglu
patent: 2004/0174995 (2004-09-01), Singh
patent: 2004/0228485 (2004-11-01), Abu et al.
patent: 2006/0002562 (2006-01-01), Berenstein et al.
patent: 2006/0023887 (2006-02-01), Agrawal et al.
patent: 2008/0181413 (2008-07-01), Yi et al.
patent: 0576224 (1993-12-01), None
patent: WO 0004422 (2000-01-01), None
Harn, L.; “Group-oriented (t, n) threshold digital signature scheme and digital multisignature”, IEE Proc.-Comput. Digit. Tech., vol. 141, No. 5, Sep. 1994, pp. 307-313.
Lin, T.-Y.; Wu, T.-C., “(t, n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems”, IEE Proc.-Comput. Digit. Tech., vol. 146, No. 5, Sep. 1999, pp. 264-268.
Yi Xun; Tan, Chik How; Siew, Chee Kheong; Syed, Mahbubur Rahman; “ID-Based Key Agreement for Multimedia Encryption”, IEEE Transactions on Consumer Electronics, vol. 48, No. 2, May 2002, pp. 298-303.
Iwamoto, Mitsugu; Yamamoto, Hirosuke; “Visual Secret Sharing Schemes for Plural Secret Images”, ISIT 2003, IEEE, p. 283.
Stinson, Doug; “Visual cryptography and threshold schemes”, IEEE Potentials, Feb./Mar. 1999, pp. 13-16.
Shamir, “How to Share a Secret”, Communications of the ACM, vol. 22, No. 11, Nov. 1979, pp. 612-613.

Affiliated with

Also associated with

Rating

Secret sharing technique with low overhead information content does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Secret sharing technique with low overhead information content, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secret sharing technique with low overhead information content will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4279127