Sciweavers

106 search results - page 14 / 22
» Trusted Multiplexing of Cryptographic Protocols
Sort
View
131
Voted
POPL
2000
ACM
15 years 7 months ago
Authentication Primitives and Their Compilation
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
Martín Abadi, Cédric Fournet, George...
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
16 years 3 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
128
Voted
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...
CTRSA
2010
Springer
149views Cryptology» more  CTRSA 2010»
15 years 10 months ago
Usable Optimistic Fair Exchange
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a ...
Alptekin Küpçü, Anna Lysyanskaya
130
Voted
EUROCRYPT
2003
Springer
15 years 8 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell