David Chaum on Electronic Commerce How much do you trust Big Brother?

@article{Chaum1997DavidCO,
  title={David Chaum on Electronic Commerce How much do you trust Big Brother?},
  author={David Chaum},
  journal={IEEE Internet Computing},
  year={1997},
  volume={1},
  pages={8-16}
}
  • D. Chaum
  • Published 1 November 1997
  • Computer Science
  • IEEE Internet Computing
A bout 20 years ago David Chaum had a vision of the future of information technology that changed his life. At the time Chaum was studying for his doctorate in computer science at the University of California, Berkeley, where he was working on cryptographic protocols for establishing trust between mutually untrusting parties. Chaum intuitively " got " where the Internet was taking us, and began to think about models that would make electronic commerce feasible. What eventually resulted was a… 

A brief survey of Cryptocurrency systems

A perspective on how Cryptocurrencies mine is surveyed and compared and contrast current mining techniques as used by major Cryptocurrency, and the strengths, weaknesses, and possible threats to each mining strategy are evaluated.

Privacy on the Web: an Examination of User Concerns, Technology, and Implications for Business Organizations and Individuals

This article explores privacy concerns associated with the implementation of new information technology and introduces a new concept termed the “information technology privacy cycle” and examines individual privacy on the Web.

Pre-study on Customer Care , Accounting , Charging , Billing , and Pricing

It has been observed within this pre-study that closed platforms show a matured state with proprietary products, applications, and tools, sometimes offering semi-open interfaces allowing for the integration with additional system components, but lacking open semantics.

Scientific Paper Peer-Reviewing System With Blockchain, IPFS, and Smart Contract

This chapter proposes a decentralized and anonymous scientific peer-reviewing system using blockchain technology that will integrate all the above concern issues and eliminate the bias or trust issues interconnected with the peer- reviewing process.

Achieving guaranteed anonymity in time-series location data

A novel privacy metric, called Time-ToConfusion, is developed to characterize the privacy implication of anonymous location traces and two different privacy-preserving techniques are proposed that achieve both the guaranteed location privacy of all users and high data quality.

Charging and Accounting for Integrated Internet Services - State of the Art, Problems, and Trends -

An investigation of best-effort and integrated services Internet characteristics in terms of suitable, applicable, or existent solutions and approaches for charging and accounting methods is provided.

Quantitative Characterization and Prediction of On-Line Purchasing Behavior: A Latent Variable Approach

A quantitative framework that uses factor analysis to identify latent factor descriptors of Internet users’ opinions on Web vendors and on-line shopping is proposed and shows that the obtained latent factors agree in general with the major indicators identified in previous qualitative research.

Information Systems Management

  • 1997

References

SHOWING 1-9 OF 9 REFERENCES

Untraceable electronic mail, return addresses, and digital pseudonyms

A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of

Security without Identification: Card Computers to make Big Brother Obsolete

Computerization is robbing individuals of the ability to monitor and control the ways information about them is used, and the automation of payment and other consumer transactions is expanding these dangers to an unprecedented extent.

The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities

  • D. Chaum
  • Computer Science, Mathematics
    CRYPTO
  • 1989
The proposed solutions, including those presented here, are based on two kinds of assumptions: (a) public-key cryptography; and (b) limited collusion in a setting where pairs of participants can exchange messages with secret and authenticated content.

Algorithms for quantum computation: discrete logarithms and factoring

  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

Security without identification: transaction systems to make big brother obsolete

The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.

Communication theory of secrecy systems

  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.

Achieving Electronic Privacy

The Dining Cryptographers Problem: Unconditional Sender Untraceability

  • J. Cryptology
  • 1988

Privacy Protected Payments: Unconditional Payer and/or Payee Untraceability

  • Privacy Protected Payments: Unconditional Payer and/or Payee Untraceability
  • 1989