You are here

Bibliography

Export 138 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Title is P  [Clear All Filters]
2005
Sassaman L, Cohen B, Mathewson N. The Pynchon Gate: A Secure Method of Pseudonymous Mail Retrieval. In: Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2005). Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2005). Arlington, VA, USA: ACM New York, NY, USA; 2005. Available from: http://portal.acm.org/citation.cfm?id=1102199.1102201
2003
Serjantov A, Lewis S. Puzzles in P2P Systems. In: 8th CaberNet Radicals Workshop. 8th CaberNet Radicals Workshop. Ajaccio, Corsica: Network of Excellence in Distributed and Dependable Computing Systems; 2003.
2007
Dolstra E, Hemel A. Purely functional system configuration management. In: HOTOS'07: Proceedings of the 11th USENIX workshop on Hot topics in operating systems. HOTOS'07: Proceedings of the 11th USENIX workshop on Hot topics in operating systems. Berkeley, CA, USA: USENIX Association; 2007. pp. 1–6. Available from: http://portal.acm.org/citation.cfm?id=1361410#
2006
Pianese F, Keller J, Biersack EW. PULSE, a Flexible P2P Live Streaming System. In: INFOCOM'06. Proceedings of the 25th IEEE International Conference on Computer Communications. INFOCOM'06. Proceedings of the 25th IEEE International Conference on Computer Communications. Barcelona, Catalunya, Spain: IEEE Computer Society; 2006. pp. -1–1.
2000
Waldman M, Rubin AD, Cranor L. Publius: A robust, tamper-evident, censorship-resistant and source-anonymous web publishing system. In: Proceedings of the 9th USENIX Security Symposium. Proceedings of the 9th USENIX Security Symposium. ; 2000. pp. 59–72. Available from: http://portal.acm.org/citation.cfm?id=1251311
1999
Paillier P. Public-key Cryptosystems Based on Composite Degree Residuosity Classes. In: Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques. Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques. Berlin, Heidelberg: Springer-Verlag; 1999. Available from: http://dl.acm.org/citation.cfm?id=1756123.1756146
1985
El Gamal T. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Proceedings of CRYPTO 84 on Advances in cryptology. Proceedings of CRYPTO 84 on Advances in cryptology. Santa Barbara, California: Springer-Verlag New York, Inc.; 1985. pp. 10–18. Available from: http://dl.acm.org/citation.cfm?id=19478.19480s
2005
Cramer C, Fuhrmann T. Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks. In: Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing. Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing. Konstanz, Germany: IEEE Computer Society Washington, DC, USA; 2005. pp. 3–10. Available from: http://i30www.ira.uka.de/research/publications/p2p/
2011
Levchenko K, McCoy D. Proximax: Fighting Censorship With an Adaptive System for Distribution of Open Proxies. In: FC'11 - Proceedings of Financial Cryptography and Data Security . FC'11 - Proceedings of Financial Cryptography and Data Security . St. Lucia; 2011.
2009
Tariq MA, Koldehofe B, Koch GG, Rothermel K. Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems. In: Kommunikation in Verteilten Systemen (KiVS). Kommunikation in Verteilten Systemen (KiVS). Gesellschaft fuer Informatik(GI); 2009. pp. 155–166. Available from: http://www.springerlink.com/content/x36578745jv7wr88/
2008
Di P, Kutzner K, Fuhrmann T. Providing KBR Service for Multiple Applications. In: The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08). The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08). St. Petersburg, U.S.; 2008. Available from: http://i30www.ira.uka.de/research/publications/p2p/
2004
Perng G, Wang C, Reiter MK. Providing content-based services in a peer-to-peer environment. In: in Proceedings of the third International Workshop on Distributed Event-Based Systems (DEBS. in Proceedings of the third International Workshop on Distributed Event-Based Systems (DEBS. ; 2004. pp. 74–79. Available from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.4393&rep=rep1&type=pdf
2010
Tariq MA, Koldehofe B, Altaweel A, Rothermel K. Providing basic security mechanisms in broker-less publish/subscribe systems. In: DEBS '10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems. DEBS '10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems. New York, NY, USA: ACM; 2010. pp. 38–49. Available from: http://portal.acm.org/citation.cfm?id=1827418.1827425&coll=portal&dl=GUIDE#
2003
Möller B. Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes. In: Proceedings of CT-RSA 2003. Proceedings of CT-RSA 2003. Springer-Verlag, LNCS 2612; 2003. Available from: http://eprints.kfupm.edu.sa/59837/
2004
Berman R, Fiat A, Ta-Shma A. Provable Unlinkability Against Traffic Analysis. In: Juels A Proceedings of Financial Cryptography (FC '04). Proceedings of Financial Cryptography (FC '04). Springer-Verlag, LNCS 3110; 2004. pp. 266–280. Available from: http://www.springerlink.com/content/cknab9y9bpete2ha/
2005
Klonowski M, Kutylowski M. Provable Anonymity for Networks of Mixes. In: Proceedings of Information Hiding Workshop (IH 2005). Proceedings of Information Hiding Workshop (IH 2005). Springer Berlin / Heidelberg; 2005. pp. 26–38. Available from: http://www.springerlink.com/content/777769630v335773/
Garcia FD, Hasuo I, Pieters W, van Rossum P. Provable Anonymity. In: Proceedings of the 3rd ACM Workshop on Formal Methods in Security Engineering (FMSE05). Proceedings of the 3rd ACM Workshop on Formal Methods in Security Engineering (FMSE05). Alexandria, VA, USA; 2005. Available from: http://portal.acm.org/citation.cfm?id=1103576.1103585
1982
Yao AC. Protocols for Secure Computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society; 1982. Available from: http://dx.doi.org/10.1109/SFCS.1982.88

Pages