Title page for etd-0825109-012834


[Back to Results | New Search]

URN etd-0825109-012834
Author Yao-chun Yu
Author's Email Address No Public.
Statistics This thesis had been viewed 5572 times. Download 12 times.
Department Computer Science and Engineering
Year 2008
Semester 2
Degree Master
Type of Document
Language English
Title An E-Cash Protocol with Efficient Double-Spending Revocability
Date of Defense 2009-07-07
Page Count 46
Keyword
  • Double-Spending
  • Chameleon Hash Functions
  • E-Cash
  • Anonymity
  • Untraceability
  • Abstract Due to the fast progress of the internet technologies, electronic commerce becomes
    more and more popular. Many people and businesses deal with their transactions via the
    internet. The technologies of credit cards, electronic tickets, e-cash, and other advanced services
    have realized the vision of electronic commerce. In this thesis, we propose an off-line
    e-cash scheme with anonymity, untraceability, double-spending checking, and traceability.
    Anonymity and untraceability must be possessed in any e-cash scheme. In an off-line e-cash
    scheme, the bank or the third party (TTP) must be able to revoke the anonymity of a user who
    doubly spent her/his e-cash(s). In our proposed e-cash scheme, the bank can fast derive the
    identity of the user who doubly spent her/his e-cash(s) without the participation of TTP. If
    some illegal transactions are reported, TTP can also directly revoke the anonymity of the user
    who spent her/his e-cash(s) in the illegal transactions. In addition, the police needs to trace
    a specific user in some situation, and we propose a process to satisfy this requirement,called
    traceability.
    Advisory Committee
  • D. J. Guan - chair
  • Chung-Huang Yang - co-chair
  • Wen-Shenq Juang - co-chair
  • Chun-I Fan - advisor
  • Files
  • etd-0825109-012834.pdf
  • indicate in-campus access in a year and off_campus not accessible
    Date of Submission 2009-08-25

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys