Wallet Databases with Observers
David Chaum,Torben P. Pedersen +1 more
- 16 Aug 1992
- pp 89-105
TL;DR: This article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.
read more
Abstract: Previously there have been essentially only two models for computers that people can use to handle ordinary consumer transactions: (1) the tamper-proof module, such as a smart card, that the person cannot modify or probe: and (2) the personal workstation whose inner working is totally under control of the individual. The first part of this article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.Then it is shown how this combined device, called a wallet, ran carry a database containing personal information. The construction presented ensures that no single part of the device (i.e. neither the tamper-proof part nor the workstation) can learn the contents of the database -- this information can only be recovered by the two parts together.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient and practical fair exchange protocols with off-line TTP
Feng Bao,Robert H. Deng,Wenbo Mao +2 more
- 03 May 1998
TL;DR: The protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages and introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols.
349
How to Date Blind Signatures
Masayuki Abe,Eiichiro Fujisaki +1 more
- 03 Nov 1996
TL;DR: It is proved that forging the proposed scheme by multiple signing is as difficult as breaking RSA and an electronic cash system is shown that successfully minimizes the growth of the bank's database.
336
Secure Outsourced Matrix Computation and Application to Neural Networks
Xiaoqian Jiang,Miran Kim,Kristin E. Lauter,Yongsoo Song +3 more
- 15 Oct 2018
TL;DR: This work presents a practical solution to encrypt a matrix homomorphically and perform arithmetic operations on encrypted matrices, and is the first work that supports secure evaluation of the prediction phase based on both encrypted data and encrypted model.
333
Threshold Ring Signatures and Applications to Ad-hoc Groups
Emmanuel Bresson,Jacques Stern,Michael Szydlo +2 more
- 18 Aug 2002
TL;DR: In this article, Rivest et al. improved on their ring signature paradigm by showing that it holds under a strictly weaker assumption, namely the random oracle model rather than the ideal cipher.
•Posted Content
Practical Verifiable Encryption and Decryption of Discrete Logarithms.
Jan Camenisch,Victor Shoup +1 more
TL;DR: The first verifiable encryption scheme that provides chosen ciphertext security and avoids inecient cut-and-choose proofs was proposed in this paper, based on Paillier's decision composite residuosity assumption.
322
References
How to prove yourself: practical solutions to identification and signature problems
Amos Fiat,Adi Shamir +1 more
- 01 Jan 1987
TL;DR: Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.
A digital signature scheme secure against adaptive chosen-message attacks
TL;DR: A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.
Patent
Untraceable electronic cash
Daniel R. Simon
- 29 Aug 1996
TL;DR: An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
1.2K
Untraceable Electronic Cash
David Chaum,Amos Fiat,Moni Naor +2 more
- 01 Feb 1990
TL;DR: The use of credit cards today is an act of faith on the p a t of all concerned as discussed by the authors, and each party is vulnerable to fraud by the others, and the cardholder in particular has no protection against surveillance.
Witness indistinguishable and witness hiding protocols
Uriel Feige,Adi Shamir +1 more
- 01 Apr 1990
TL;DR: This work proves two central results: Unlike zero knowledge protocols, witness indistinguishablity is preserved under arbi t rary composition of protocols, including parallel execution, and any witness indistinguishable protocol for this s ta tement is also.
Related Papers (5)
Amos Fiat,Adi Shamir +1 more
- 01 Jan 1987
Mihir Bellare,Phillip Rogaway +1 more
- 01 Dec 1993
David Chaum
- 01 Jan 1983