Yes / Despite the significant role that multiparty international joint ventures (MPIJVs) play within multinational enterprises, we know little about the significant challenges associated with the management of these ventures. Therefore, we combine the Resource-based View of the Firm and Transaction Cost Economics to investigate the effects of the key aspects of partner diversity (i.e., variety, balance, and disparity) on MPIJV dissolution. We test our hypotheses using a dataset of 248 MPIJVs in China. We find empirical support for a U-curve shaped effect of variety and a negative linear effect of balance on MPIJV dissolution.

Le recours collectif est un moyen de procédure qui permet à une personne d'agir en demande pour le compte des membres d'un groupe dont elle fait partie. Cette procédure peut être introduite contre plus qu'un seul défendeur. On distingue deux types de recours collectifs contre plusieurs défendeurs. Il y a d'abord les recours collectifs où tous les membres du groupe ont un recours personnel contre tous les défendeurs. Il y a aussi les recours collectifs où les membres du groupe font valoir une même cause d'action à l'encontre de plusieurs défendeurs qui auraient eu un comportement fautif similaire à l'égard de l'un ou l'autre des membres du groupe. La recevabilité de ce dernier type de recours collectifs a été remise en question. Le requérant n'aurait pas l'intérêt suffisant pour ester en justice contre les défendeurs qui ne lui ont pas causé préjudice. Il ne saurait non plus satisfaire aux exigences du Code de procédure civile concernant l'autorisation du recours collectif. Or, il appert des règles mises en place en matière de recours collectif que le requérant fait valoir non seulement ses propres droits personnels, mais aussi tous ceux des membres du groupe. Ainsi, on ne peut lui reprocher l'absence d'intérêt juridique ou de cause d'action dans la mesure où il y a, pour chacun des défendeurs, au moins un membre du groupe avec un intérêt suffisant ou une cause d'action à son encontre. Les autres exigences du Code de procédure civile ne font pas, en soi, obstacle à l'autorisation d'un recours collectif contre plusieurs défendeurs. / A class action is a procedure which enables one person to sue without a mandate on behalf of aU members of a group of which he or she is a member. This procedure can be used to sue more than just one defendant. There are two different types of class actions against multiple defendants. In the frrst type, aU members have a cause of action against all defendants. There are also class actions where aU members plead an identical cause of action against multiple defendants whom wrongfuUy and similarly acted toward one of the members. The admissibility of this latter type of class actions against multiple defendants has been questioned. The petitioner would not have a sufficient legal interest to bring an action against the defendants whom did not cause him or her any prejudice. He or she would not be able to satisfy the requirements of the Code of civil procedure regarding class actions. However, it appears from the mIes that govem class actions that the petitioner pleads not only his or her personal cause of action, but also pleads the cause of action of aU group members. Thus, the petitioner cannot be reproached for not having a legal interest or a cause of action against aU defendants insofar that there is, for each defendant, at least one member of the group whom has a legal interest or a cause of action against him or her. The other requirements of the Code ofcivil procedure do not bar the authorization to institute a class action against multiple defendants.

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / Em razÃo da crescente demanda de usuÃrios mÃveis por conteÃdos criados com formato especÃfico e personalizado, ou adaptado para atender suas necessidades e preferÃncias no uso da web, as redes convergentes sensÃveis ao contexto incorporam uma promissora tecnologia para permitir aplicaÃÃes de serviÃos personalizados a mÃltiplos usuÃrios. O projeto C-CAST (Context Casting) (C-CAST, 2012) foi estabelecido para arquiteturas de redes convergentes sensÃveis ao contexto para suportar sessÃes com qualidade de serviÃo (QoS - Quality of Service) de forma garantida a mÃltiplos usuÃrios, simultaneamente, independentemente de suas tecnologias de conexÃo sem fio. O mecanismo de controle do C-CAST Legado introduz questÃes de degradaÃÃo de desempenho, visto que a abordagem de sinalizaÃÃo adotada à direcionada por fluxo. Isto significa que a carga de sinalizaÃÃo aumenta exponencialmente com o nÃmero de admissÃes de fluxo. Este trabalho propÃe o C-CAST AvanÃado, o qual aperfeiÃoa o sistema do C-CAST Legado pela extensÃo de mecanismos inovadores que integram um controle dinÃmico da largura de banda sobreaprovisionada por classes de serviÃo e alocaÃÃo de Ãrvores overlay. Por meio dessa estratÃgia, busca-se reduzir taxas de sinalizaÃÃo de controle e alocaÃÃo de recursos em todo o sistema. A avaliaÃÃo do C-CAST AvanÃado à conduzida por meio de simulaÃÃo, demonstrando seus benefÃcios em relaÃÃo ao C-CAST Legado, por otimizar significativamente os nÃveis de desempenho de todo o sistema de rede, enquanto mantÃm usuÃrios com a melhor percepÃÃo de qualidade. / Due to the increase demand of mobile users for content created in a specific and customized way, or adapted to comply with the needs and preferences in web usage, converged networks which are context-sensitive have been incorporated to a promising technology and enabled applications of personalized services to multiple users. The C-CAST project (Context Casting) was established to converged network architectures to support context-sensitive sessions with quality of service (QoS - Quality of Service) in a manner to guarantee to multiple users simultaneously, regardless of their wireless technologies. The C-CAST control mechanism of the Legacy introduces issues of performance degradation, once the signaling approach adopted is directed per-flow, which means that the signaling load increases exponentially with the number of admissions flow. This work proposes the Advanced of C-CAST, which reconstruct the C-CAST legacy system by the extent of innovative mechanisms that integrate dynamic control of provisioned bandwidth by the service classes and allocation overlay trees. Through this strategy, it seeks to reduce rates of control signaling and allocating resources throughout the system. The C-CAST Advanced evaluation is conducted through simulation, demonstrating its benefits in relation to C-CAST Legacy, by significantly optimization the performance levels of the entire network system while keep the network users with the best quality perception.

En este trabajo se propone y desarrolla una topología en k-hipercubos que resuelve los principales inconvenientes asociados a la topología en hipercubo convencional. Los resultados obtenidos son muy prometedores, con aplicaciones tanto en el campo de la voz sobre IP, como en muchos otros campos que precisen de un intercambio de información muchos a muchos. Sobre la topología propuesta se define el protocolo Darkcube, que es una propuesta de protocolo totalmente distribuido basado en el concepto de darknet, posibilitando la realización de conversaciones muchos a muchos incluyendo audio, vídeo, texto y datos de geoposicionamiento, entre otros. También se propone un método de codificación de coordenadas de geoposicionamiento que resulta especialmente eficiente en el aprovechamiento del ancho de banda sobrante en las comunicaciones muchos a muchos que proporciona Darkcube. Durante el desarrollo de este trabajo, se ha implementado el simulador DarkcubeEmu; herramienta que posibilita la obtención de resultados relevantes en términos de la calidad de la comunicación. Finalmente, utilizando como base el protocolo Darkcube, se propone un protocolo de seguridad que traslada un esquema de infraestructura de clave pública a un protocolo totalmente distribuido, como es Darkcube; garantizando, de esta forma, la confidencialidad en las comunicaciones y la legitimidad de la identidad asociada a cada uno de sus miembros.

<p>Text communication is often perceived as lacking some components of communication that are essential in sustaining interaction or conversation. This interaction incoherency tends to make&nbsp / text communication plastic. It is traditionally devoid of intonation, pitch, gesture, facial expression and visual or auditory cues. Nevertheless, Instant Messaging (IM), a form of text communication is on the upward uptake both on PCs and on mobile handhelds. There is a need to rubberise this plastic text messaging to improve co-presence for text communications thereby improving&nbsp / synchronous textual discussion, especially on handheld devices. One element of interaction is gesture, seen as a natural way of conversing. Attaining some level of interaction naturalism&nbsp / requires improving synchronous communication spontaneity, partly achieved by enhancing input mechanisms. To enhance input mechanisms for interactive text-based chat on mobile devices,&nbsp / there is a need to facilitate gesture input. Enhancement is achievable in a number of ways, such as input mechanism redesigning and input offering adaptation. This thesis explores affective gesture mode on interface redesign as an input offering adaptation. This is done without a major physical reconstruction of handheld devices. This thesis presents a text only IM system built on&nbsp / Session Initiation Protocol (SIP) and SIP for Instant Messaging and Presence Leveraging Extensions (SIMPLE). It was developed with a novel user-defined hotkey implemented as a one-click context menu to &ldquo / fast-track&rdquo / text-gestures and emoticons. A hybrid quantitative and qualitative approach was taken to enable data triangulation. Results from experimental trials show that an&nbsp / Affective Gesture (AG)approach improved IM chat spontaneity/response. Feedback from the user trials affirms that AG hotkey improves chat responsiveness, thus enhancing chat spontaneity.</p>

Le recours collectif est un moyen de procédure qui permet à une personne d'agir en demande pour le compte des membres d'un groupe dont elle fait partie. Cette procédure peut être introduite contre plus qu'un seul défendeur. On distingue deux types de recours collectifs contre plusieurs défendeurs. Il y a d'abord les recours collectifs où tous les membres du groupe ont un recours personnel contre tous les défendeurs. Il y a aussi les recours collectifs où les membres du groupe font valoir une même cause d'action à l'encontre de plusieurs défendeurs qui auraient eu un comportement fautif similaire à l'égard de l'un ou l'autre des membres du groupe. La recevabilité de ce dernier type de recours collectifs a été remise en question. Le requérant n'aurait pas l'intérêt suffisant pour ester en justice contre les défendeurs qui ne lui ont pas causé préjudice. Il ne saurait non plus satisfaire aux exigences du Code de procédure civile concernant l'autorisation du recours collectif. Or, il appert des règles mises en place en matière de recours collectif que le requérant fait valoir non seulement ses propres droits personnels, mais aussi tous ceux des membres du groupe. Ainsi, on ne peut lui reprocher l'absence d'intérêt juridique ou de cause d'action dans la mesure où il y a, pour chacun des défendeurs, au moins un membre du groupe avec un intérêt suffisant ou une cause d'action à son encontre. Les autres exigences du Code de procédure civile ne font pas, en soi, obstacle à l'autorisation d'un recours collectif contre plusieurs défendeurs. / A class action is a procedure which enables one person to sue without a mandate on behalf of aU members of a group of which he or she is a member. This procedure can be used to sue more than just one defendant. There are two different types of class actions against multiple defendants. In the frrst type, aU members have a cause of action against all defendants. There are also class actions where aU members plead an identical cause of action against multiple defendants whom wrongfuUy and similarly acted toward one of the members. The admissibility of this latter type of class actions against multiple defendants has been questioned. The petitioner would not have a sufficient legal interest to bring an action against the defendants whom did not cause him or her any prejudice. He or she would not be able to satisfy the requirements of the Code of civil procedure regarding class actions. However, it appears from the mIes that govem class actions that the petitioner pleads not only his or her personal cause of action, but also pleads the cause of action of aU group members. Thus, the petitioner cannot be reproached for not having a legal interest or a cause of action against aU defendants insofar that there is, for each defendant, at least one member of the group whom has a legal interest or a cause of action against him or her. The other requirements of the Code ofcivil procedure do not bar the authorization to institute a class action against multiple defendants. / "Mémoire présenté à la Faculté des études supérieures en vue de l'obtention du grade de maître en droit". Ce mémoire a été accepté à l'unanimité et classé parmi les 15% des mémoires de la discipline. Commentaires du jury : "Le jury vous encourage à publier".

<p>Text communication is often perceived as lacking some components of communication that are essential in sustaining interaction or conversation. This interaction incoherency tends to make&nbsp / text communication plastic. It is traditionally devoid of intonation, pitch, gesture, facial expression and visual or auditory cues. Nevertheless, Instant Messaging (IM), a form of text communication is on the upward uptake both on PCs and on mobile handhelds. There is a need to rubberise this plastic text messaging to improve co-presence for text communications thereby improving&nbsp / synchronous textual discussion, especially on handheld devices. One element of interaction is gesture, seen as a natural way of conversing. Attaining some level of interaction naturalism&nbsp / requires improving synchronous communication spontaneity, partly achieved by enhancing input mechanisms. To enhance input mechanisms for interactive text-based chat on mobile devices,&nbsp / there is a need to facilitate gesture input. Enhancement is achievable in a number of ways, such as input mechanism redesigning and input offering adaptation. This thesis explores affective gesture mode on interface redesign as an input offering adaptation. This is done without a major physical reconstruction of handheld devices. This thesis presents a text only IM system built on&nbsp / Session Initiation Protocol (SIP) and SIP for Instant Messaging and Presence Leveraging Extensions (SIMPLE). It was developed with a novel user-defined hotkey implemented as a one-click context menu to &ldquo / fast-track&rdquo / text-gestures and emoticons. A hybrid quantitative and qualitative approach was taken to enable data triangulation. Results from experimental trials show that an&nbsp / Affective Gesture (AG)approach improved IM chat spontaneity/response. Feedback from the user trials affirms that AG hotkey improves chat responsiveness, thus enhancing chat spontaneity.</p>

Submitted by Irene Nascimento (irene.kessia@ufpe.br) on 2016-06-22T17:04:20Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Utilizando o Protocolo Bitcoin para Condução de Computações Multilaterais Seguras e Justas.pdf: 1665447 bytes, checksum: 2ff437be55e080c80d97e0d6582cb360 (MD5) / Made available in DSpace on 2016-06-22T17:04:20Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Utilizando o Protocolo Bitcoin para Condução de Computações Multilaterais Seguras e Justas.pdf: 1665447 bytes, checksum: 2ff437be55e080c80d97e0d6582cb360 (MD5) Previous issue date: 2016-02-02 / Suponha que dois milionários desejam descobrir quem é o mais rico sem que, para isso, um descubra o valor da fortuna do outro. Esse problema pode ser facilmente resolvido se ambos concordarem sobre um juiz a quem eles possam confiar a tarefa de calcular a resposta sem quebrar a privacidade de nenhum dos dois. O desafio, no entanto, é substituir esse juiz por uma interação multilateral, ou protocolo, que alcance o mesmo grau de segurança. Isso significa conduzir uma computação multilateral segura. Esse exemplo é conhecido como o problema dos milionários de Yao e foi proposto por Andrew Yao em um dos primeiros esforços para desenvolver uma forma geral de se conduzir computações multilaterais seguras. Desde lá, na década de 1980, vários avanços foram feitos nesse sentido e, hoje, já é um resultado bem estabelecido que qualquer função multilateral pode ser computada de maneira segura. Esse importante resultado, no entanto, vem com uma importante ressalva: a justiça não pode ser alcançada de maneira geral. Entende-se por justiça a garantia de que, no final de uma computação, ou todos os participantes recebem suas respostas ou nenhum deles recebe. Motivadas por esse resultado de impossibilidade, várias definições alternativas de justiça foram concebidas. Uma delas considera uma computação como sendo justa se os participantes que agirem desonestamente forem monetariamente penalizados. Ou seja, se alguns participantes receberem o resultado da computação e privarem os demais de receberem, então esse conluio é penalizado e os demais participantes, compensados. Com essa definição, uma computação justa pode ser vista como o cumprimento de um contrato, no qual cada participante se compromete a agir honestamente ou a pagar uma multa. Sob essa perspectiva, trabalhos recentes mostram como criptomoedas podem ser utilizadas para escrever esses contratos e, portanto, servir para condução de computações multilaterais seguras e monetariamente justas. Uma criptomoeda é um sistema monetário que se baseia em princípios criptográficos para alcançar segurança e controlar a taxa de emissão de novas moedas. O Bitcoin, criado em 2008 por Satoshi Nakamoto, foi a primeira realização dessa ideia. Ele se baseia em uma estrutura de dados pública chamada blockchain, que armazena o histórico de todas as transações já realizadas. A segurança da blockchain, incluindo sua não-maleabilidade, é garantida pela dificuldade da prova de trabalho exigida para que novas informações sejam adicionadas nessa estrutura. Cada transferência de moedas no Bitcoin é feita de maneira que um usuário só pode recebê-las mediante a apresentação de uma entrada que satisfaça um script especificado pelo remetente. Contratos escritos através desses scripts se fazem cumprir sem a necessidade de intervenção de uma parte confiável externa. Essa característica é o que faz o Bitcoin ser adequado e atrativo para se conferir justiça para computações multilaterais seguras. Um dos nossos objetivos neste trabalho é a realização de um estudo sobre os resultados que permitem a computação segura de uma função qualquer e dos que estabelecem a impossibilidade de se alcançar justiça de maneira geral. Tentaremos manter o rigor matemático para evitar uma apresentação estritamente panorâmica. Além disso, analisaremos criticamente uma construção proposta para utilizar o Bitcoin como plataforma para condução de computações multilaterais seguras e justas. Por fim, a partir dos pontos positivos e negativos levantados, apresentaremos uma proposta nossa com a mesma finalidade. / Suppose that two millionaires want to find out which one is the richest, but without revealing how much their fortunes are worth in the process. This problem can be easily solved if they trust a judge to compute the desired answer without compromising their privacy. The challenge, however, is to replace such a judge by a multiparty interaction, or protocol, that achieves the same level of security. That is, the challenge is to carry out a secure multiparty computation. The previous example is known as Yao’s millionaires’ problem and was stated by Andrew Yao in one of the first efforts to develop a general algorithm to carry out secure multiparty computations. Since then, in the 1980s, several advances were made to achieve this goal and, nowadays, it is a well-established result that any multiparty function can be securely computed. This important result, however, comes with an important restriction: fairness cannot be achieved in general. Fairness is the guarantee that, at the end of a computation, either all parties receive their outputs or none of them does. Motivated by this impossibility, several alternative definitions of fairness have been proposed. One of them considers a computation to be fair if the dishonest parties are monetarily penalized and the honest ones are monetarily compensated. According to this definition, a fair computation can be viewed as the enforcement of a contract, in which the parties agree on paying a penalty if they misbehave. Recent works have shown how cryptocoins can be used to write those contracts and, therefore, to be used for carrying out secure and monetarily fair multiparty computations. A cryptocoin is a monetary system that relies on cryptographic principles for achieving security and controlling the coin issuing rate. Bitcoin, created in 2008 by Satoshi Nakamoto, was the first practical realization of this idea. In its core, there is a publicly maintained data structure called blockchain, which works as a ledger and stores every transaction ever made. The security of the blockchain, including its non-malleability, is guaranteed by the difficulty of the proof of work required to add new data to it. A Bitcoin transaction can only be redeemed by a user that presents an input satisfying a script specified by the issuer of the transaction. Contracts written on these scripts are enforced without an external trusted third-party to intervene. This makes Bitcoin suitable and interesting to confer monetary fairness to multiparty computations. One of the goals of this work is to present the results that allow any function to be securely computed and the ones that show the impossibility of achieving fairness in general. We will try to present these results with the appropriate mathematical rigor to avoid giving just an overview of them. We will also analyze a recently proposed construction that uses Bitcoin as a platform to carry out fair multiparty computations. Finally, based on its positive and negative points, we will propose a construction with the same goal.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2016-09-12T17:38:34Z No. of bitstreams: 2 Tese - Ana Lúcia Henrique Teixeira Gomes - 2016.pdf: 2620593 bytes, checksum: 790809188e3c89fdfc4bb46b49c9dc4c (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-09-15T13:04:37Z (GMT) No. of bitstreams: 2 Tese - Ana Lúcia Henrique Teixeira Gomes - 2016.pdf: 2620593 bytes, checksum: 790809188e3c89fdfc4bb46b49c9dc4c (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-09-15T13:04:37Z (GMT). No. of bitstreams: 2 Tese - Ana Lúcia Henrique Teixeira Gomes - 2016.pdf: 2620593 bytes, checksum: 790809188e3c89fdfc4bb46b49c9dc4c (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-02-26 / Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG / Brazil has the most fragmented system in the world. The present research assesses 20 years of regulation in Brazil focusing on the main aspects related to party fragmentation: partisan creation rules, thresholds, prerogatives in legislatures and party funding - collated to party EffNs indices from 1994 to 2015. Besides, it organizes the EMB data on party registering since 1979, the electoral party offer since 1994, and assesses the EffNs in the beginning of each legislative year in order to check fragmentation after elections. The research adds a Legislative approach, counting time in Congresses. It concludes that the constant amendments on the original National Party Act (Law # 9,096/1995) – many of them by judicial review jeopardized the balance intended by the Constitutional Writers who fostered party creation, controlled by a legislature threshold that regulated access to party funding, using carrots more than sticks to enhance a democratic culture in a new democracy. The amendments, including ban on threshold and increasing party funding with spread distribution, ended up promoting the creation of parties by floor-crossing with all the prerogatives of elected members backed by judicial reviews. The results compromise electoral integrity and contribute to the institutional crisis the country faces today. / A presente pesquisa teve como objetivo investigar as causas da fragmentação partidária no atual período democrático do Brasil, tomada como proxy para a crescente percepção de dissenso entre as bancadas, a partir da análise da Lei dos Partidos (9.096/1995) e suas alterações até 2015. A fragmentação, medida pelo índice EffNs, é a variável dependente e a regulação partidária a variável independente. Para tanto, compara a legislação partidária atual com a existente desde a primeira Lei Orgânica dos Partidos (LOPP), ainda no regime militar, em 1965, privilegiando as principais inovações relacionadas ao aumento do número de partidos com representação: as regras para a criação de partidos, o funcionamento parlamentar atrelado à cláusula de desempenho e a distribuição de recursos do fundo partidário. Em seguida, faz um levantamento sistemático dos pedidos de registro de partidos desde o fim do bipartidarismo na 46ª Legislatura (1979 – 1983), sua relação com a oferta eleitoral de partidos cotejada pelo índice de fragmentação, medido pelo Número Efetivo de Partidos baseados nos assentos (EffNs), desde as eleições de 1994 - que trouxeram à Câmara dos Deputados a última bancada eleita antes da alteração da legislação, em 1995 - até 2015. Detém particular atenção sobre os períodos “intereleições” a partir da análise da movimentação das bancadas e seus efeitos sobre a fragmentação no início dos trabalhos de cada sessão legislativa entre 1995 e 2014. A pesquisa contribui com a literatura sobre multipartidarismo brasileiro, a partir do estudo de 20 anos de vigência do principal documento legal sobre a atual organização dos partidos no Brasil. Conclui que o fim da cláusula de desempenho, o aumento dos recursos e da distribuição igualitária do fundo e a punição da infidelidade partidária com a perda do mandato acabaram por quebrar o equilíbrio traçado pela Constituinte e pela legislação original, que incentivava o consenso e a construção de maiorias, com engenhoso mecanismo de freios e contrapesos de caráter muito mais educativo (carrots) do que punitivo (sticks). Com o apoio dos tribunais superiores, estas alterações tiveram como corolário a criação de partidos com recrutamento de quadros internos com todas as prerrogativas proporcionais à bancada eleita, na 54ª Legislatura (2011 – 2015), comprometendo a integridade eleitoral, a formação de maiorias e, consequentemente, a governabilidade, contribuindo para a grave crise institucional do presidencialismo de coalizão.

The end of third-party cookies has driven the advertising market to seek new solutions. Third-party cookies were widely used to track users’ online activities across websites. However, the growing concern for privacy has led web browsers to put an end to this practice. In this thesis, we explore two potential solutions for private attribution reporting - Multi-Party Computation (MPC) and Trusted Execution Environment (TEE). Attribution reporting is used by advertisers to measure the effectiveness of a marketing campaign. The underlying process requires identifying which advertisement led to a conversion. To test and compare these two technologies, we used the Interoperable Private Attribution (IPA) research prototype developed by Benjamin Case et al. for MPC, and developed our own models for TEE using Intel-SGX. Our TEE models have two distinct approaches: the first model uses EdgelessDB, a SQL database stored inside a secure enclave, which offers a high level of abstraction and flexibility for advertisers. The second model employs Gramine, a library that enables the compilation and execution of code inside a secure enclave. In this solution, the code is written in C and the input data is stored in an encrypted file. We compared the time performance and the security of these models. According to our results, the Gramine model is faster than the other models. Additionally, the security provided by IntelSGX, although dependent on a high level of trust in Intel services, is better than the security offered by an MPC protocol. Based on our tests, TEE is a better solution for attribution reporting. Nevertheless, MPC is a rapidly evolving technology, and new algorithms have been developed our tests. Further testing with a new implementation of MPC could be a potential avenue for future work. / Slutet på third-party cookies har tvingat annonsmarknaden att söka nya lösningar. Third-party cookies användes ofta för att spåra användares aktiviteter på olika webbplatser. Dock har den ökande oro för privatliv ledt webbläsare att avsluta denna praxis. I denna rapport utforskar vi två potentiella lösningar på problemet med attributrapportering - MultiParty Computation (MPC) och Trusted Execution Environment (TEE). Attributrapportering används av annonsörer för att mäta effektiviteten av en marknadsföringskampanj. Underliggande process kräver att identifiera vilken annons som ledde till en konvertering. För att testa och jämföra dessa två teknologier använde vi en Interoperable Private Attribution (IPA) forskningsprototyp utvecklad av Benjamin Case och al. för MPC och utvecklade våra egna modeller för TEE med Intel-SGX. Våra TEE-modeller har två distinkta tillvägagångssätt: den första modellen använder EdgelessDB, en SQL-databas som lagras inuti en säker miljö, vilket erbjuder en hög nivå av abstraktion och flexibilitet för annonsörer. Den andra modellen använder Gramine, en bibliotek som möjliggör kompilering och körning av kod inuti en säker miljö. I denna lösning är koden skriven i C och indata lagras i en krypterad fil. Vi jämförde prestanda och säkerhet för dessa modeller. Enligt våra resultat är Gramine-modellen snabbare än de andra modellerna. Dessutom är säkerheten som tillhandahålls av Intel-SGX, även om den är beroende av en hög nivå av förtroende för Intel-tjänster, bättre än säkerheten som erbjuds av en MPC-protokoll. Baserat på våra tester är TEE en bättre lösning för attributrapportering. Trots detta är MPC en snabbt utvecklande teknologi, och nya algoritmer har ut.