Verifying Privacy Preserving Combinatorial Auctions

Suppose you are competing in an online sealed bid auction for some goods. How do you know the auction result can be trusted? The auction site could be performing actions that support its own commercial interests by blocking certain bidders or even reporting incorrect winning prices. This problem is magnified when the auctioneer is an unknown party and the auctions are for high value items. The incentive for the auctioneer to cheat can be high as they could stand to make a significant profit by inflating winning prices or by being paid by a certain bidder to announce them the winner. Verification of auction results provides confidence in the auction result by making it computationally infeasible for an auction participant to cheat and not get caught. This thesis examines the construction of verifiable privacy preserving combinatorial auction protocols. Two verifiable privacy preserving combinatorial auction protocols are produced by extending existing auction protocols

LIPIcs, Volume 251, ITCS 2023, Complete Volume

LIPIcs, Volume 251, ITCS 2023, Complete Volum

An Approach to Guide Users Towards Less Revealing Internet Browsers

When browsing the Internet, HTTP headers enable both clients and servers send extra data in their requests or responses such as the User-Agent string. This string contains information related to the sender’s device, browser, and operating system. Previous research has shown that there are numerous privacy and security risks result from exposing sensitive information in the User-Agent string. For example, it enables device and browser fingerprinting and user tracking and identification. Our large analysis of thousands of User-Agent strings shows that browsers differ tremendously in the amount of information they include in their User-Agent strings. As such, our work aims at guiding users towards using less exposing browsers. In doing so, we propose to assign an exposure score to browsers based on the information they expose and vulnerability records. Thus, our contribution in this work is as follows: first, provide a full implementation that is ready to be deployed and used by users. Second, conduct a user study to identify the effectiveness and limitations of our proposed approach. Our implementation is based on using more than 52 thousand unique browsers. Our performance and validation analysis show that our solution is accurate and efficient. The source code and data set are publicly available and the solution has been deployed

Optimization of 5G Second Phase Heterogeneous Radio Access Networks with Small Cells

Due to the exponential increase in high data-demanding applications and their services per coverage area, it is becoming challenging for the existing cellular network to handle the massive sum of users with their demands. It is conceded to network operators that the current wireless network may not be capable to shelter future traffic demands. To overcome the challenges the operators are taking interest in efficiently deploying the heterogeneous network. Currently, 5G is in the commercialization phase. Network evolution with addition of small cells will develop the existing wireless network with its enriched capabilities and innovative features. Presently, the 5G global standardization has introduced the 5G New Radio (NR) under the 3rd Generation Partnership Project (3GPP). It can support a wide range of frequency bands (<6 GHz to 100 GHz). For different trends and verticals, 5G NR encounters, functional splitting and its cost evaluation are well-thought-out. The aspects of network slicing to the assessment of the business opportunities and allied standardization endeavours are illustrated. The study explores the carrier aggregation (Pico cellular) technique for 4G to bring high spectral efficiency with the support of small cell massification while benefiting from statistical multiplexing gain. One has been able to obtain values for the goodput considering CA in LTE-Sim (4G), of 40 Mbps for a cell radius of 500 m and of 29 Mbps for a cell radius of 50 m, which is 3 times higher than without CA scenario (2.6 GHz plus 3.5 GHz frequency bands). Heterogeneous networks have been under investigation for many years. Heterogeneous network can improve users service quality and resource utilization compared to homogeneous networks. Quality of service can be enhanced by putting the small cells (Femtocells or Picocells) inside the Microcells or Macrocells coverage area. Deploying indoor Femtocells for 5G inside the Macro cellular network can reduce the network cost. Some service providers have started their solutions for indoor users but there are still many challenges to be addressed. The 5G air-simulator is updated to deploy indoor Femto-cell with proposed assumptions with uniform distribution. For all the possible combinations of apartments side length and transmitter power, the maximum number of supported numbers surpassed the number of users by more than two times compared to papers mentioned in the literature. Within outdoor environments, this study also proposed small cells optimization by putting the Pico cells within a Macro cell to obtain low latency and high data rate with the statistical multiplexing gain of the associated users. Results are presented 5G NR functional split six and split seven, for three frequency bands (2.6 GHz, 3.5GHz and 5.62 GHz). Based on the analysis for shorter radius values, the best is to select the 2.6 GHz to achieve lower PLR and to support a higher number of users, with better goodput, and higher profit (for cell radius u to 400 m). In 4G, with CA, from the analysis of the economic trade-off with Picocell, the Enhanced multi-band scheduler EMBS provide higher revenue, compared to those without CA. It is clearly shown that the profit of CA is more than 4 times than in the without CA scenario. This means that the slight increase in the cost of CA gives back more than 4-time profit relatively to the ”without” CA scenario.Devido ao aumento exponencial de aplicações/serviços de elevado débito por unidade de área, torna-se bastante exigente, para a rede celular existente, lidar com a enormes quantidades de utilizadores e seus requisitos. É reconhecido que as redes móveis e sem fios atuais podem não conseguir suportar a procura de tráfego junto dos operadores. Para responder a estes desafios, os operadores estão-se a interessar pelo desenvolvimento de redes heterogéneas eficientes. Atualmente, a 5G está na fase de comercialização. A evolução destas redes concretizar-se-á com a introdução de pequenas células com aptidões melhoradas e características inovadoras. No presente, os organismos de normalização da 5G globais introduziram os Novos Rádios (NR) 5G no contexto do 3rd Generation Partnership Project (3GPP). A 5G pode suportar uma gama alargada de bandas de frequência (<6 a 100 GHz). Abordam-se as divisões funcionais e avaliam-se os seus custos para as diferentes tendências e verticais dos NR 5G. Ilustram-se desde os aspetos de particionamento funcional da rede à avaliação das oportunidades de negócio, aliadas aos esforços de normalização. Exploram-se as técnicas de agregação de espetro (do inglês, CA) para pico células, em 4G, a disponibilização de eficiência espetral, com o suporte da massificação de pequenas células, e o ganho de multiplexagem estatística associado. Obtiveram-se valores do débito binário útil, considerando CA no LTE-Sim (4G), de 40 e 29 Mb/s para células de raios 500 e 50 m, respetivamente, três vezes superiores em relação ao caso sem CA (bandas de 2.6 mais 3.5 GHz). Nas redes heterogéneas, alvo de investigação há vários anos, a qualidade de serviço e a utilização de recursos podem ser melhoradas colocando pequenas células (femto- ou pico-células) dentro da área de cobertura de micro- ou macro-células). O desenvolvimento de pequenas células 5G dentro da rede com macro-células pode reduzir os custos da rede. Alguns prestadores de serviços iniciaram as suas soluções para ambientes de interior, mas ainda existem muitos desafios a ser ultrapassados. Atualizou-se o 5G air simulator para representar a implantação de femto-células de interior com os pressupostos propostos e distribuição espacial uniforme. Para todas as combinações possíveis do comprimento lado do apartamento, o número máximo de utilizadores suportado ultrapassou o número de utilizadores suportado (na literatura) em mais de duas vezes. Em ambientes de exterior, propuseram-se pico-células no interior de macro-células, de forma a obter atraso extremo-a-extremo reduzido e taxa de transmissão dados elevada, resultante do ganho de multiplexagem estatística associado. Apresentam-se resultados para as divisões funcionais seis e sete dos NR 5G, para 2.6 GHz, 3.5GHz e 5.62 GHz. Para raios das células curtos, a melhor solução será selecionar a banda dos 2.6 GHz para alcançar PLR (do inglês, PLR) reduzido e suportar um maior número de utilizadores, com débito binário útil e lucro mais elevados (para raios das células até 400 m). Em 4G, com CA, da análise do equilíbrio custos-proveitos com pico-células, o escalonamento multi-banda EMBS (do inglês, Enhanced Multi-band Scheduler) disponibiliza proveitos superiores em comparação com o caso sem CA. Mostra-se claramente que lucro com CA é mais de quatro vezes superior do que no cenário sem CA, o que significa que um aumento ligeiro no custo com CA resulta num aumento de 4-vezes no lucro relativamente ao cenário sem CA

A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks

© 2013 IEEE. The past decade has witnessed the rapid evolution in blockchain technologies, which has attracted tremendous interests from both the research communities and industries. The blockchain network was originated from the Internet financial sector as a decentralized, immutable ledger system for transactional data ordering. Nowadays, it is envisioned as a powerful backbone/framework for decentralized data processing and data-driven self-organization in flat, open-access networks. In particular, the plausible characteristics of decentralization, immutability, and self-organization are primarily owing to the unique decentralized consensus mechanisms introduced by blockchain networks. This survey is motivated by the lack of a comprehensive literature review on the development of decentralized consensus mechanisms in blockchain networks. In this paper, we provide a systematic vision of the organization of blockchain networks. By emphasizing the unique characteristics of decentralized consensus in blockchain networks, our in-depth review of the state-of-the-art consensus protocols is focused on both the perspective of distributed consensus system design and the perspective of incentive mechanism design. From a game-theoretic point of view, we also provide a thorough review of the strategy adopted for self-organization by the individual nodes in the blockchain backbone networks. Consequently, we provide a comprehensive survey of the emerging applications of blockchain networks in a broad area of telecommunication. We highlight our special interest in how the consensus mechanisms impact these applications. Finally, we discuss several open issues in the protocol design for blockchain consensus and the related potential research directions

Service management for multi-domain Active Networks

The Internet is an example of a multi-agent system. In our context, an agent is synonymous with network operators, Internet service providers (ISPs) and content providers. ISPs mutually interact for connectivity's sake, but the fact remains that two peering agents are inevitably self-interested. Egoistic behaviour manifests itself in two ways. Firstly, the ISPs are able to act in an environment where different ISPs would have different spheres of influence, in the sense that they will have control and management responsibilities over different parts of the environment. On the other hand, contention occurs when an ISP intends to sell resources to another, which gives rise to at least two of its customers sharing (hence contending for) a common transport medium. The multi-agent interaction was analysed by simulating a game theoretic approach and the alignment of dominant strategies adopted by agents with evolving traits were abstracted. In particular, the contention for network resources is arbitrated such that a self-policing environment may emerge from a congested bottleneck. Over the past 5 years, larger ISPs have simply peddled as fast as they could to meet the growing demand for bandwidth by throwing bandwidth at congestion problems. Today, the dire financial positions of Worldcom and Global Crossing illustrate, to a certain degree, the fallacies of over-provisioning network resources. The proposed framework in this thesis enables subscribers of an ISP to monitor and police each other's traffic in order to establish a well-behaved norm in utilising limited resources. This framework can be expanded to other inter-domain bottlenecks within the Internet. One of the main objectives of this thesis is also to investigate the impact on multi-domain service management in the future Internet, where active nodes could potentially be located amongst traditional passive routers. The advent of Active Networking technology necessitates node-level computational resource allocations, in addition to prevailing resource reservation approaches for communication bandwidth. Our motivation is to ensure that a service negotiation protocol takes account of these resources so that the response to a specific service deployment request from the end-user is consistent and predictable. To promote the acceleration of service deployment by means of Active Networking technology, a pricing model is also evaluated for computational resources (e.g., CPU time and memory). Previous work in these areas of research only concentrate on bandwidth (i.e., communication) - related resources. Our pricing approach takes account of both guaranteed and best-effort service by adapting the arbitrage theorem from financial theory. The central tenet for our approach is to synthesise insights from different disciplines to address problems in data networks. The greater parts of research experience have been obtained during direct and indirect participation in the 1ST-10561 project known as FAIN (Future Active IP Networks) and ACTS-AC338 project called MIAMI (Mobile Intelligent Agent for Managing the Information Infrastructure). The Inter-domain Manager (IDM) component was integrated as an integral part of the FAIN policy-based network management systems (PBNM). Its monitoring component (developed during the MIAMI project) learns about routing changes that occur within a domain so that the management system and the managed nodes have the same topological view of the network. This enabled our reservation mechanism to reserve resources along the existing route set up by whichever underlying routing protocol is in place

Communications

The communications sector of an economy comprises a range of technologies, physical media, and institutions/rules that facilitate the storage of information through means other than a society\u27s oral tradition and the transmission of that information over distances beyond the normal reach of human conversation. This chapter provides data on the historical evolution of a disparate range of industries and institutions contributing to the movement and storage of information in the United States over the past two centuries. These include the U.S. Postal Service, the newspaper industry, book publishing, the telegraph, wired and cellular telephone service, radio and television, and the Internet

Journal of Telecommunications and Information Technology, 2011, nr 3

kwartalni

Defending networked resources against floods of unwelcome requests

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2008.Includes bibliographical references (p. 172-189).The Internet is afflicted by "unwelcome requests'" defined broadly as spurious claims on scarce resources. For example, the CPU and other resources at a server are targets of denial-of-service (DOS) attacks. Another example is spam (i.e., unsolicited bulk email); here, the resource is human attention. Absent any defense, a very small number of attackers can claim a very large fraction of the scarce resources. Traditional responses identify "bad" requests based on content (for example, spam filters analyze email text and embedded URLs). We argue that such approaches are inherently gameable because motivated attackers can make "bad" requests look "good". Instead, defenses should aim to allocate resources proportionally (so if lo% of the requesters are "bad", they should be limited to lo% of the scarce resources). To meet this goal, we present the design, implementation, analysis, and experimental evaluation of two systems. The first, speak-up, defends servers against application-level denial-of-service by encouraging all clients to automatically send more traffic. The "good" clients can thereby compete equally with the "bad" ones. Experiments with an implementation of speak-up indicate that it allocates a server's resources in rough proportion to clients' upload bandwidths, which is the intended result. The second system, DQE, controls spam with per-sender email quotas. Under DQE, senders attach stamps to emails. Receivers communicate with a well-known, untrusted enforcer to verify that stamps are fresh and to cancel stamps to prevent reuse. The enforcer is distributed over multiple hosts and is designed to tolerate arbitrary faults in these hosts, resist various attacks, and handle hundreds of billions of messages daily (two or three million stamp checks per second). Our experimental results suggest that our implementation can meet these goals with only a few thousand PCs.(cont) The enforcer occupies a novel design point: a set of hosts implement a simple storage abstraction but avoid neighbor maintenance, replica maintenance, and mutual trust. One connection between these systems is that DQE needs a DoS defense-and can use speak-up. We reflect on this connection, on why we apply speak-up to DoS and DQE to spam, and, more generally, on what problems call for which solutions.by Michael Walfish.Ph.D