195 search results - page 13 / 39 » Security and Privacy Using One-Round Zero-Knowledge Proofs |
161
Voted
CSFW
2005
IEEE
15 years 9 months ago
2005
IEEE
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
116
click to vote
SSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
153
click to vote
CSFW
2007
IEEE
15 years 7 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
127
Voted
ICISC
2008
15 years 4 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
105
click to vote
CSFW
2010
IEEE
15 years 7 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...