Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2006-08-15
2006-08-15
Zand, Kambiz (Department: 2132)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S161000, C713S168000, C713S181000, C705S067000, C705S076000
Reexamination Certificate
active
07093130
ABSTRACT:
A digital ticket is procured by a client ticket consumer upon, preferably, the Internet from and by staged interaction with a ticket provider server. The digital ticket becomes embodied in a tangible transportable data storage medium, normally a 2-D bar code printed on paper by the consumer, or on the consumer's flexible disk or smart card, containing Sign(s,I||hash(R))||R where (1) R is a number having its origin in the computer of the ticket consumer, which number R is appended to (2) a number Sign(s,I||hash(R)). This number Sign(s,I||hash(R)) was earlier computed in the computer of the ticket provider as a digital signature using signature key s of a number hash(R) combined with event information I, and was subsequently communicated across the communications network to the computer of the ticket consumer. The number hash(R) was itself even earlier computed in the computer of the ticket consumer as a one-way function of random number R, which computed one-way function was subsequently communicated to the computer of the ticket provider. The number R is private to the ticket consumer and not public; the digital signature key s is private to the ticket provider.The digital ticket is redeemed by (1) transporting the transportable storage medium within which the Sign(s,I||hash(R))||R is written to the particular selected event; (2) tendering the digital ticket for verification and for admission; (3) reading the Sign(s,I||hash(R))||R to an event computer and extracting the number R; (4) decrypting the remaining Sign(s, I||hash(R)) with verification key v of the ticket producer to get hash(R) and I; (5) re-calculating from R, with the same one-way function previously used, a re-calculated hash(R); then, having this recalculated hash(R) to hand; (6) comparing the re-calculated hash(R) to the extracted hash(R). The (4) decrypting will work, producing a proper I for the selected event, and the (6) comparing will be equal, only for a legitimate ticket.
REFERENCES:
patent: 5629980 (1997-05-01), Stefik et al.
patent: 5634012 (1997-05-01), Stefik et al.
patent: 5638443 (1997-06-01), Stefik et al.
patent: 5715403 (1998-02-01), Stefik
patent: 6178409 (2001-01-01), Weber et al.
patent: 6253193 (2001-06-01), Ginter et al.
patent: 6289108 (2001-09-01), Rhoads
patent: 6389402 (2002-05-01), Ginter et al.
patent: 6523067 (2003-02-01), Mi et al.
patent: 6801929 (2004-10-01), Donoho et al.
patent: 2002/0116616 (2002-08-01), Mi et al.
AIM Standard, Uniform Symbology Specification PDF417, pp. 1-3.
Mullender, editor; The Amoeba Distributed Operating System: Selected Papers 1984-1987; Centre for Mathematics and Computer Science, 1987, p. 1.
Okamoto et al., “Universal Electronic Cash,” Advances in Cryptology—Crypto, 1991, pp. 324-337; Springer-Verlag, Berlin Heidelberg 1992.
United States Postal Service Specification, Performance Criteria and Security Architecture for Open IBI Postage Evidencing System, USPS-I-3195, pp. 1-84, Feb. 23, 2000.
RSA SecurID Ready Implementation Guide, AXENT Technologies, Inc., pp. 1-7, Sep. 14, 2000.
Fujimura et al., “XML Ticket: Generalized Digital Ticket Definition Language,” NTT Information Sharing Platform Laboratories, pp. 1-5.
Brown, R.D., “Digital Signatures for XML,” IETF Internet Draft, Jan. 1999, pp. 1-53.
Fujimura et al., “General-purpose Digital Ticket Framework,” USENIX, Proceedings of the 3rdUSENIX Workshop on Electronic Commerce, Boston, Massachusetts, Aug. 31-Sep. 3, 1998, pp. 1-11.
Fujimura et al, “Digital-Ticket-Controlled Digital Ticket Circulation,” USENIX, Proceedings of the 8thUSENIX Security Symposium, Washington, D.C., Aug. 23-26, 1999, pp. 1-12.
XML Scheme Requirements, the World Wide Consortium, Note, Feb. 1999 (see http://www.w3.org/TF/NOTE-xml-schema-req), pp. 1-5.
Rivest et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystens,” MIT Laboratory for Computer Science and Department of Mathematics, pp. 120-126, 1978.
RSA Public Key Encryption System, Text Instructions, retrieved from the web at http://library.wolfram.com/infocenter/mathsource/1966, 1966, one page.
Tygar et al, “Cryptographic Postage Indicia,” In Concurrency and Parallelism, Programming, Networking, and Security, eds. J. Jaffar and R. Yap. Springer, 1996, pp. 378-391.
Tygar et al., “Cryptography: It's Not Just forElectronicMail Anymore,” Carnegie Mellon University Computer Science technical report CMU-CS-93-107, Mar. 1993, pp. 1-21.
Kobayashi Noriya
Yee Bennet
The Regents of the University of California
Zand Kambiz
LandOfFree
System and method for delivering and examining digital tickets does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for delivering and examining digital tickets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for delivering and examining digital tickets will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3633971