Sciweavers

25 search results - page 2 / 5
» Anonymity in Transferable E-cash
Sort
View
CANS
2009
Springer
105views Cryptology» more  CANS 2009»
13 years 11 months ago
Transferable Constant-Size Fair E-Cash
We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a ce...
Georg Fuchsbauer, David Pointcheval, Damien Vergna...
IPPS
2006
IEEE
13 years 11 months ago
Shubac: a searchable P2P network utilizing dynamic paths for client/server anonymity
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
A. Brodie, Cheng-Zhong Xu, Weisong Shi
NAR
2011
233views Computer Vision» more  NAR 2011»
12 years 7 months ago
TIARA: a database for accurate analysis of multiple personal genomes based on cross-technology
High-throughput genomic technologies have been used to explore personal human genomes for the past few years. Although the integration of technologies is important for high-accura...
Dongwan Hong, Sung-Soo Park, Young Seok Ju, Sheehy...
STOC
1999
ACM
122views Algorithms» more  STOC 1999»
13 years 9 months ago
Oblivious Transfer and Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
Moni Naor, Benny Pinkas
WINE
2010
Springer
154views Economy» more  WINE 2010»
13 years 2 months ago
The Good, The Bad and The Cautious: Safety Level Cooperative Games
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...
Yoram Bachrach, Maria Polukarov, Nicholas R. Jenni...