MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Philippe Golle – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 13 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Reputable Mix Networks  
  • by Philippe Golle — 2004
  • …We define a new type of mix network that offers a reduced form of robustness: the mixnet can prove that every message it outputs corresponds to an input submitted by a player without revealing which input (for honest players). We call mixnets with this property reputable mixnets. Reputable mixnets a…
  • Cited by 2 (0 self) – Add To MetaCart
  • Secure Distributed Computing in a Commercial Environment  
  • by Philippe Golle, Stuart Stubblebine — 2001 — 5th International Conference Financial Cryptography (FC
  • …The recent successes of a number of nonprofit computing projects distributed over the Internet has generated intense interest in the potential commercial applications of distributed computing. In a commercial setting, where participants might be paid for their contributions, it is crucial to def…
  • Cited by 11 (0 self) – Add To MetaCart
  • Reusable Anonymous Return Channels  
  • by Philippe Golle, Markus Jakobsson — 2003 — In Proceedings of the ACM Workshop on Privacy in the Electronic Society
  • …Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the ability to reply one or more times, and to further reply to replies, is essential to a complete anonymous conversation.…
  • Cited by 7 (2 self) – Add To MetaCart
  • Almost Entirely Correct Mixing with Applications to Voting  
  • by Dan Boneh, Philippe Golle — 2002 — In ACM CCS ’02
  • …In order to design an exceptionally e#cient mix network, both asymptotically and in real terms, we develop the notion of almost entirely correct mixing, and propose a new mix network that is almost entirely correct. In our new mix, the real cost of proving correctness is orders of magnitude faster t…
  • Cited by 17 (1 self) – Add To MetaCart
  • Uncheatable Distributed Computations  
  • by Philippe Golle, Ilya Mironov — 2001 — Lecture Notes in Computer Science
  • …Computationally expensive tasks that can be parallelized are most efficiently completed by distributing th computation...…
  • Cited by 27 (0 self) – Add To MetaCart
  • Authenticating Streamed Data in the Presence of Random Packet Loss (Extended Abstract)  
  • by Philippe Golle, Nagendra Modadugu — 2001 — ISOC Network and Distributed System Security Symposium
  • …We propose a new scheme for authenticating streamed data delivered in real-time over an insecure network. The difficulty of signing live streams is twofold. First, authentication must be efficient so the stream can be processed without delay. Secondly, authentication must be possible even if some pa…
  • Cited by 23 (0 self) – Add To MetaCart
  • Enhancing the Privacy of Web-based Communication  
  • by Aleksandra Korolova, Ayman Farahat, Philippe Golle — 2005
  • …A profiling adversary is an adversary whose goal is to classify a population of users into categories according to messages they exchange. This adversary models the most common privacy threat against web based communication.…
  • Add To MetaCart
  • Secure Conjunctive Keyword Search over Encrypted Data  
  • by Philippe Golle, Jessica Staddon, Brent Waters — 2004 — ACNS 04: 2nd International Conference on Applied Cryptography and Network Security
  • …We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterion, the user gives the server a capability that allows the server to identify exactly those documents.…
  • Cited by 13 (1 self) – Add To MetaCart
  • Universal Re-encryption for Mixnets  
  • by Philippe Golle , Markus Jakobsson, Ari Juels, Paul Syverson — 2002 — IN PROCEEDINGS OF THE 2004 RSA CONFERENCE, CRYPTOGRAPHER’S TRACK
  • …We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player with knowledge of the public key corresponding to a given ciphertext. In contrast, universal re-encryption can be don…
  • Cited by 59 (8 self) – Add To MetaCart
  • Optimistic Mixing for Exit-Polls  
  • by Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, Ari Juels — 2002 — Asiacrypt 2002, LNCS 2501
  • …We propose a new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly (the usual case). Our mix network only produces an output if no server cheats. However, in the rare case when one or several mix servers cheat, we convert t…
  • Cited by 15 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB