Sciweavers

3115 search results - page 525 / 623
» Synthesizing Secure Protocols
Sort
View
LICS
1999
IEEE
15 years 8 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
DIM
2007
ACM
15 years 8 months ago
Receipt management- transaction history based trust establishment
In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerning current transactions. One ...
Abhilasha Bhargav-Spantzel, Jungha Woo, Elisa Bert...
ACMICEC
2006
ACM
117views ECommerce» more  ACMICEC 2006»
15 years 8 months ago
Practical secrecy-preserving, verifiably correct and trustworthy auctions
We present a practical protocol based on homomorphic cryptography for conducting provably fair sealed-bid auctions. The system preserves the secrecy of the bids, even after the an...
David C. Parkes, Michael O. Rabin, Stuart M. Shieb...
EUROCRYPT
2000
Springer
15 years 8 months ago
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
Eyal Kushilevitz, Rafail Ostrovsky
FC
2000
Springer
127views Cryptology» more  FC 2000»
15 years 8 months ago
Blind, Auditable Membership Proofs
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...
Tomas Sander, Amnon Ta-Shma, Moti Yung