,
, Percentage of nodes viewing 99% of the stream and distribution of the corresponding stream lag (upload capped at 700 kbps)
, Percentage of nodes viewing 99% of the stream and bandwidth usage distribution with different fanout values and upload caps
, Percentage of nodes viewing the stream with at most 1% jitter as a function of the refresh rate X and request rate
, Surviving nodes: percentage viewing 99% of the stream, and average percentage of complete windows, vol.14
, Three-phase gossip performance in homogeneous and heterogeneous settings (left); and architecture of HEAP (right)
,
,
, Cumulative distribution of stream lag in the ref-691 and ms-691 scenarios for HEAP and standard 3-ph gossip
, Bandwidth usage over time and by capability class with no message loss and slow retransmission, p.24
, Stream Lag and bandwidth usage with the RPS running at various frequencies-different values of t RPS -in homo-691
, Stream Lag with various view sizes (v RPS ) for the random peer sampling protocol for standard HEAP and for a variant without retransmission
, Whisker plots for sample average obtained from the RPS view with increasing network sizes, p.27
, Percentage of nodes receiving a clear stream over time with a catastrophic failure of 20% or 50% of the nodes happening at t=60s
, Stream Lag for HEAP and delivery rate for the external application for T app = 200ms (left) and T app = 100ms (right) with an application duty cycle of 50%. The key in Fig. 4.10a applies to both plots, p.30
, Stream Lag for HEAP and delivery rate for the external application for higher duty cycles (d c ) and several values of B app (different lines) with T app = 200ms
, With RLNC, C can send useful information to D and E without knowing what they have received, p.34
, 40 5.3 Comparison of exchanged packet rate, used bandwidth and message delay for 5.3a pulp original (k = 6, ttl = 4) and 5.3b our algorithm (k = 5, ttl = 4), Pulp (5.2a) and our algorithm (5.2b) behavior under various configuration of the protocol (fanout and time to live)
, How adaptiveness algorithms impact the protocol efficiency
Delay in dynamic networks: varying network configurations (a) and churn (b), p.43 ,
,
, In this example, after exchanging their profiles, Alice and Bob modify their neighbors in order to be connected with the users who share the most their interests
, Interactions between (1) user opinion; (2) WUP: implicit social network; (3) BEEP: news dissemination protocol 54
, F1-Score depending on the fanout and message cost
, 60 7.5 [Dislike and Amplification in BEEP on the Survey dataset, Survey: Size of the LSCC depending on the approach, p.61
,
,
, Survey dataset: centralized vs decentralized, recall vs popularity, and F1-Score vs sociability, p.64
, Simplified information flow through the protocol's data structures
, Complete information flow through the protocol's data structures
, Impact of compacting the profiles (various b-to-d ratios)
, Impact of filtering sensitive information (various filter sizes, f s)
Impact of obfuscating profiles and randomizing dissemination (f s = 200), p.75 ,
,
, OPRD vs 2-DP: F1-Score vs number of messages
, Randomness vs performance and level of privacy
, Recommendation quality with different levels of randomization of user profiles. This quality is not significantly hampered by levels of randomization of up to 75%
, Overview of the H&S similarity computation mechanism
, Recommendation quality expressed as precision and recall with a varying number of recommendations r, using the MovieLens datasets
, Recommendation quality expressed as precision and recall with a varying number of recommendations r, using the Jester dataset
, The H&S similarity is the main source of perturbation of neighborhood quality, Effect of compact profiles and the H&S similarity on neighborhood quality
, Trade-off between recommendation quality and privacy for the H&S-based system and a system with perturbation-based privacy, vol.87
, Average bandwidth consumption of a peer per gossip cycle. The H&S-based system consumes roughly twice to seven times more bandwidth than our system model with 5 to 50 landmarks, p.88
, Average storage space needed for a peer. The H&S-based system needs less storage space because peers only store the seed used to generate landmarks
, SC: scientific guidance, CT: core technical contribution, EX: experiments, WT: writing As per the guidelines, the list below highlights my name and those of the students of which I am a main supervisor. Awards Best Paper Award at IC2E Stéphane Delbruel, Davide Frey, François Taïani: Exploring the Use of Tags for Georeplicated Content Placement, vol.2, pp.172-181, 2016.
The quadratic shortest path problem: complexity, approximability, and solution methods, European Journal of Operational Research, vol.268, issue.2, pp.473-485, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01781605
An Adaptive Peer-Sampling Protocol for Building Networks of Browsers, In: World Wide Web, vol.25, p.1678, 2017. ,
Privacy-Preserving Distributed Collaborative Filtering, Rating: A (Special Issue) Contribution: SC, vol.98, pp.827-846, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00975137
FreeRec: an Anonymous and Distributed Personalization Architecture, Computing, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00820377
Trust-Aware Peer Sampling: Performance and Privacy Tradeoffs, Theoretical Computer Science, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00872996
Multisource Rumor Spreading with Network Coding, INFOCOM 2019, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01946632
Optimal Collision/Conflict-Free Distance-2 Coloring in Wireless Synchronous Broadcast/Receive Tree Networks, 45th International Conference on Parallel Processing, pp.350-359, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01396940
Exploring The Use of Tags for Georeplicated Content Placement, IEEE IC2E'16, pp.172-181, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01257939
Mignon: A Fast Decentralized Content Consumption Estimation in Large-Scale Distributed Systems, 16th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS). Ed. by Márk Jelasity and Evangelia Kalyvianaki. Vol. LNCS-9687. Distributed Applications and Interoperable Systems, pp.32-46, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01301230
Speed for the elite, consistency for the masses: differentiating eventual consistency in large-scale distributed systems, Proceedings of the 2016 IEEE 35th Symposium on Reliable Distributed Systems (SRDS 2016), pp.197-206, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01344138
Hide & Share: Landmark-based Similarity for Private KNN Computation, p.45 ,
URL : https://hal.archives-ouvertes.fr/hal-01171492
, Rio de Janeiro, Brazil, Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp.263-274, 2015.
On the Quadratic Shortest Path Problem, 14th International Symposium on Experimental Algorithms. 14th International Symposium on Experimental Algorithms, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01251438
Behave: Behavioral Cache for Web Content, 4th International Conference on Distributed Applications and Interoperable Systems (DAIS). Ed. by Kostas Magoutis and Peter Pietzuch, vol.8460, pp.89-103, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01079976
WhatsUp Decentralized Instant News Recommender, IPDPS 2013, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00769291
FreeRec: an Anonymous and Distributed Personalization Architecture, NETYS, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00820377
Probabilistic Deduplication for Cluster-Based Storage Systems, ACM Symposium on Cloud Computing, p.17, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00728215
Social Market: Combining Explicit and Implicit Social Networks, International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.193-207, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00624129
The Gossple Anonymous Social Network, ACM/IFIP/USENIX 11th International Middleware Conference ,
URL : https://hal.archives-ouvertes.fr/inria-00515693
, LNCS-6452. Middleware, pp.191-211, 2010.
Boosting Gossip for Live Streaming, P2P 2010, pp.1-10, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00517384
Heterogeneous Gossip, Middleware 2009, pp.42-61, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00436125
Stretching Gossip with Live Streaming, DSN 2009, pp.259-264, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00436130
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks, 8th International Conference on Peer-to-Peer Computing, pp.351-361, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00337054
Context-Aware Publish Subscribe in Mobile ad Hoc Networks, Coordination. Paphos, Cyprus, pp.37-55, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00739641
Minimizing the Reconfiguration Overhead in Content-Based Publish-Subscribe, Symposium on Applied Computing, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00739607
Lightweight Privacy-Preserving Averaging for the Internet of Things, M4IOT 2016 -3rd Workshop on Middleware for Context-Aware Applications in the IoT, pp.19-22, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01421986
Bringing secure Bitcoin transactions to your smartphone, Proceedings of the 15th International Workshop on Adaptive and Reflective Middleware (ARM 2016), vol.3, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01384461
Solipsis: A Decentralized Architecture for Virtual Environments, 1st International Workshop on Massively Multiuser Virtual Environments, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00337057
Towards lightweight information dissemination in inter-vehicular networks, Proceedings of the 3rd international workshop on Vehicular ad hoc networks. Los Angeles, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00739632
Publish-subscribe tree maintenance over a DHT, DEBS 2005 Workshop colocated with ICDCS, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00739617
, Demos
Web Information System Engineering, WebGC Gossiping on Browsers without a Server, 2015. ,
WebGC: Browser-Based Gossiping, 2014. ,
WhatsUp: news from, for, through everyone, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00515420
Dietcoin: shortcutting the Bitcoin verification process for your smartphone, François Taïani, and Spyros Voulgaris ,
URL : https://hal.archives-ouvertes.fr/hal-01743995
Live Streaming with Gossip, 2017. ,
URL : https://hal.archives-ouvertes.fr/inria-00436130
Rumor Spreading and Conductance, J. ACM, vol.65, pp.1-17, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01942162
Robust Decentralized Mean Estimation with Limited Communication, Parallel Processing -24th International Conference on Parallel and Distributed Computing, pp.447-461, 2018. ,
AT2: Asynchronous Trustworthy Transfers, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02288004
X-Search: Revisiting Private Web Search using Intel SGX, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01588883
CYCLOSA: Decentralizing Private Web Search Through SGX-Based Browser Extensions, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01882430
A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform, 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp.51-58, 2018. ,
Algorand: Scaling Byzantine Agreements for Cryptocurrencies, Proceedings of the 26th Symposium on Operating Systems Principles. SOSP '17, pp.51-68, 2017. ,
Differentially Private Linear Models for Gossip Learning through Data Perturbation, vol.101, pp.1-2017080613445, 2017. ,
Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination, Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC '17, pp.151-153, 2017. ,
Network Latency Estimation for Personal Devices: A Matrix Completion Approach, IEEE/ACM Trans. Netw, vol.25, pp.724-737, 2017. ,
PAG: Private and Accountable Gossip, 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016, pp.35-44, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01368911
How Asynchrony Affects Rumor Spreading Time, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. PODC '16, pp.185-194, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01353698
Model Inversion Attacks That Exploit Confidence Information and Basic Countermeasures, Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security. CCS '15, pp.1322-1333, 2015. ,
The MovieLens Datasets: History and Context", In: ACM Trans. Interact. Intell. Syst, vol.5, 2015. ,
EpTO: An Epidemic Total Order Algorithm for Large-Scale Distributed Systems, Proceedings of the 16th Annual Middleware Conference. Middleware '15, pp.100-111, 2015. ,
SmoothCache 2.0: CDN-quality Adaptive HTTP Live Streaming on Peer-to-peer Overlays, Oregon, 2015. ,
Neighborhood Filtering Strategies for Overlay Construction in P2P-TV Systems: Design and Experimental Comparison, IEEE/ACM TON, vol.23, issue.3, pp.1063-6692, 2015. ,
EagleMacaw: A Dual-Tree Replication Protocol for Efficient and Reliable P2P Media Streaming ,
ReStream -A Replication Algorithm for Reliable and Scalable Multimedia Streaming ,
Adding Virtualization Capabilities to the Grid'5000 Testbed, Communications in Computer and Information Science, vol.367, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00946971
A Peer-to-peer Recommender System for Self-emerging User Communities Based on Gossip Overlays, Journal of Computer and System Sciences, vol.79, issue.2, pp.291-308, 2013. ,
Through the wormhole: Low cost, fresh peer sampling for the Internet ,
BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom Filters ,
URL : https://hal.archives-ouvertes.fr/hal-00724829
A Delaybased Aggregate Rate Control for P2P Streaming Systems, Comput. Commun, vol.35, pp.140-3664, 2012. ,
Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams, English. In: Peer-to-Peer Networking and Applications, vol.5, issue.1, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00646616
Peer2View: A peer-to-peer HTTP-live streaming platform, 2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P), 2012. ,
SmoothCache: HTTP-Live Streaming Goes Peer-to-Peer ,
URL : https://hal.archives-ouvertes.fr/hal-01531974
Robust Overlays for Privacy-Preserving Data Dissemination over a Social Graph ,
Theory and Practice of Bloom Filters for Distributed Systems, IEEE Communications Surveys and Tutorials, pp.131-155, 2012. ,
A random indexing approach for web user clustering and web prefetching, 2012. ,
GROUP: A Gossip Based Building Community Protocol, Proceedings of the 11th International Conference and 4th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking. NEW2AN'11/ruSMART'11, 2011. ,
Architecture of a network-aware P2P-TV application: the NAPA-WINE approach, IEEE Communications Magazine, vol.49, issue.6, pp.163-6804, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00667468
A recommendation algorithm for personalized online news based on collective intelligence and content, 2011. ,
Analyzing network coding gossip made easy, Proceedings of the forty-third annual ACM symposium on Theory of computing, pp.293-302, 2011. ,
Distributed rating prediction in user generated content streams, Proceedings of the fifth ACM conference on Recommender systems. RecSys '11, pp.69-76, 2011. ,
Personalized social recommendations: accurate or private, 2011. ,
WHISPER: Middleware for Confidential Communication in Large-Scale Networks, Distributed Computing Systems (ICDCS), pp.456-466, 2011. ,
Tribler: P2P Media Search and Sharing, Proceedings of the 19th ACM International Conference on Multimedia. MM '11, pp.739-742, 2011. ,
D2HT: The Best of Both Worlds, Integrating RPS and DHT, Eighth European Dependable Computing Conference, EDCC-8 2010, pp.135-144, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00459944
Dissent: accountable anonymous group messaging, CCS, 2010. ,
FireSpam: Spam Resilient Gossiping in the BAR Model, 29th IEEE Symposium on Reliable Distributed Systems (SRDS 2010), pp.225-234, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00945724
On the Optimal Scheduling of Streaming Applications in Unstructured Meshes, 2009. ,
An online news recommender system for social networks, SIGIR-SSM, 2009. ,
Brahms: Byzantine Resilient Random Membership Sampling, Computer Networks, p.53, 2009. ,
FoG: Fighting the Achilles' Heel of Gossip Protocols with Fountain Codes, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00429998
Epidemics and rumours in complex networks, 2009. ,
LiFT: Lightweight Freerider-Tracking Protocol, 2009. ,
T-Man: Gossip-based fast overlay topology construction, ComNet 53, vol.13, pp.1389-1286, 2009. ,
NAT-resilient Gossip Peer Sampling, ICDCS, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00945700
PRIME: Peer-to-Peer Receiver-Driven Mesh-Based Streaming, 2009. ,
Streamline: An Architecture for Overlay Multicast ,
The Design and Deployment of a BitTorrent Live Video Streaming Solution, 11th IEEE International Symposium on Multimedia, pp.342-349, 2009. ,
A Survey of Collaborative Filtering Techniques, Advances in Artificial Intelligence, 2009. ,
MuON: Epidemic based mutual anonymity in unstructured P2P networks, Comput. Netw, 2008. ,
Epidemic Live Streaming: Optimal Performance Trade-offs, SIGMETRICS, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00668529
Differential privacy: a survey of results, 2008. ,
, Inside the New Coolstreaming: Principles, Measurements and Performance Implications". In: INFOCOM, 2008.
FlightPath: Obedience vs. Choice in Cooperative Services, 2008. ,
Is Random Scheduling Sufficient in P2P Video Streaming?, In: ICDCS, 2008. ,
Bitcoin: A peer-to-peer electronic cash system, 2008. ,
Robust de-anonymization of large sparse datasets, Proceedings of the 29th IEEE Symposium on Security and Privacy, 2008. ,
Is There a Future for Mesh-Based live Video Streaming?, p.2, 2008. ,
TERA: topic-based event routing for peer-to-peer architectures, Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS), 2007. ,
VoroNet: A scalable object network based on Voronoi tessellations, 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, p.10, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00071210
,
Peer to Peer Multidimensional Overlays: Approximating Complex Structures, Principles of Distributed Systems, 11th International Conference, pp.315-328, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00164667
The Netflix Prize, Proceedings of the KDD Cup Workshop, pp.3-6, 2007. ,
, The Promise, and Limitations, vol.41, pp.8-13, 2007.
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication, 2007. ,
Dynamo: Amazon's Highly Available Key-value Store, Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles. SOSP '07, pp.978-979, 2007. ,
ARRG: Real-World Gossiping ,
Gossipbased peer sampling, In: ACM Trans. Comput. Syst, vol.25, pp.734-2071, 2007. ,
SUNNY: A New Algorithm for Trust Inference in Social Networks Using Probabilistic Confidence Models, Proceedings of the 22d National Conference on Artificial Intelligence, vol.2, pp.978-979, 2007. ,
Randomized Decentralized Broadcasting Algorithms, 2007. ,
Content-Based Recommendation Systems, The Adaptive Web: Methods and Strategies of Web Personalization, pp.325-341, 2007. ,
Gossiping with Multiple Messages, IEEE Trans. Information Theory, vol.53, pp.4640-4654, 2007. ,
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?, In: JSAC, vol.25, pp.1678-1694, 2007. ,
PersoNews: a personalized news reader enhanced by machine learning and semantic filtering, 2006. ,
Algebraic gossip: A network coding approach to optimal multiple rumor mongering, IEEE/ACM Transactions on Networking (TON), vol.14, pp.2486-2507, 2006. ,
CREW: A Gossip-based Flash-Dissemination System, Proc. of ICDCS, 2006. ,
Calibrating noise to sensitivity in private data analysis, Theory of Cryptography, 2006. ,
Network Coding: An Instant Primer, SIGCOMM Comput, vol.36, pp.146-4833, 2006. ,
, , 2006.
Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks, 2006. ,
, BAR Gossip, 2006.
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast, 2006. ,
Sub-2-Sub: Self-Organizing Content-Based Publish Subscribe for Dynamic Large Scale Collaborative Networks, 5th International workshop on Peer-To-Peer Systems, IPTPS 2006, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00070248
Deriving private information from randomized data, Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp.37-48, 2005. ,
SVD-based collaborative filtering with privacy, Proceedings of the 2005 ACM Symposium on Applied Computing, pp.791-795, 2005. ,
Evaluating similarity measures: a large-scale study in the orkut social network, 2005. ,
Introduction to data mining, 2005. ,
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, Journal of Network and Systems Management, vol.13, issue.2, pp.197-217, 2005. ,
Epidemic-Style Management of Semantic Overlays for Content-Based Searching". en, Euro-Par 2005 Parallel Processing, vol.3648, pp.1143-1152, 2005. ,
Tor: the second-generation onion router, USENIX Security Symposium, 2004. ,
From epidemics to distributed computing, IEEE Computer, vol.37, pp.60-67, 2004. ,
Epidemic Information Dissemination in Distributed Systems, In: Computer, vol.37, pp.60-67, 2004. ,
A scalable P2P recommender system based on distributed collaborative filtering, Expert Systems with Applications, vol.27, pp.957-4174, 2004. ,
Simple gossiping with balls and bins, In: Stud. Inform. Univ. 3, vol.1, pp.43-60, 2004. ,
PocketLens: toward a personal recommender system, p.TOIS, 2004. ,
Fast algorithm for detecting community structure in networks, In: Physical Review E, 2004. ,
Defending against eclipse attacks on overlay networks, 2004. ,
Information flow in social groups, Physica A: Statistical and Theoretical Physics, 2004. ,
Understanding Availability, Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), 2003. ,
, SplitStream: High-bandwidth Multicast in Cooperative Environments". In: SOSP, 2003.
Practical Network Coding, Allerton Conference on Communication, Control, and Computing, 2003. ,
The many faces of publish/subscribe, ACM Computing Surveys (CSUR), vol.35, pp.114-131, 2003. ,
, Lightweight Probabilistic Broadcast". In: ACM Transactions on Computer Systems, vol.21, pp.341-374, 2003.
Peer-to-Peer Membership Management for Gossip-Based Protocols, IEEE ToC, vol.52, pp.139-149, 2003. ,
Cryptography and cryptographic protocols, 2003. ,
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput, IEEE/ACM Trans. Netw, vol.11, pp.1063-6692, 2003. ,
On the Privacy Preserving Properties of Random Data Perturbation Techniques, Third IEEE International Conference on Data Mining, pp.99-106, 2003. ,
Probabilistic Reliable Dissemination in Large-Scale Systems, pp.248-258, 2003. ,
Probabilistic Reliable Dissemination in Large-Scale Systems, 2003. ,
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh, 2003. ,
Amazon.com Recommendations: Item-to-Item Collaborative Filtering, IEEE Internet Computing, vol.7, issue.1, 2003. ,
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques, ICDM, 2003. ,
, Bandwidth Estimation: Metrics, Measurement Techniques, and Tools, vol.17, 2003.
Collaborative Filtering with Privacy ,
Collaborative filtering with privacy via factor analysis ,
Computer Networks. 4th. Prentice Hall Professional Technical Reference, p.130661023, 2002. ,
Scalability and accuracy in a large-scale network emulator, 2002. ,
Eigentaste: A constant time collaborative filtering algorithm, Information Retrieval, vol.4, pp.133-151, 2001. ,
Random Indexing of Text Samples for Latent Semantic Analysis, 2000. ,
Randomized Rumor Spreading, FOCS, 2000. ,
, TOCS 17, vol.2, pp.41-88, 1999.
Authenticated Diffe-Hellman Key Agreement Protocols, Selected Areas in Cryptography. 1556, pp.339-361, 1999. ,
An Algorithmic Framework for Performing Collaborative Filtering, Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.230-237, 1999. ,
Good Parameters And Implementations For Combined Multiple Recursive Random Number Generators, 1998. ,
Mersenne Twister: A 623-dimensionally Equidistributed Uniform Pseudo-random Number Generator, ACM Transactions on Modeling and Computer Simulation, vol.8, issue.1, pp.3-30, 1998. ,
Centrality in sociocognitive networks and social influence: an illustration in a group decision-making context, Journal of Personality and Social Psychology, 1997. ,
Effective Erasure Codes for Reliable Computer Communication Protocols, CCR 27, vol.2, 1997. ,
GroupLens: An Open Architecture for Collaborative Filtering of Netnews, Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, pp.0-89791, 1994. ,
Using Collaborative Filtering to Weave an Information Tapestry, Commun. ACM 35, vol.12, pp.61-70, 1992. ,
Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol.4, pp.151-158, 1991. ,
An algebra for recommendations : Using reader data as a basis for measuring document proximity, 1990. ,
Epidemic Algorithms for Replicated Database Maintenance, Operating Systems Review, vol.22, pp.8-32, 1988. ,
Epidemic Algorithms for Replicated Database Maintenance, 1987. ,
Limits on the Security of Coin Flips when Half the Processors Are Faulty, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp.364-369, 1986. ,
Coin Flipping by Telephone a Protocol for Solving Impossible Problems, ACM Special Interest Group on Algorithms and Computation Theory News, vol.15, issue.1, pp.23-27, 1983. ,
Information Retrieval. en, p.9780408709293, 1979. ,
Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, pp.558-565, 1978. ,
Space/Time Trade-offs in Hash Coding with Allowable Errors, Communications of the ACM, vol.13, 1970. ,
Randomized response: a survey technique for eliminating evasive answer bias, Journal of the American Statistical Association, vol.60, pp.63-69, 1965. ,
NaCl: Networking and Cryptography library ,
, Snowflake to Avalanche: A Novel Metastable Consensus Protocol Family for Cryptocurrencies
, Tribler