نتایج جستجو برای: guarantees and parties responsibility

تعداد نتایج: 16836158  

Journal: :American Behavioral Scientist 2021

Latin Americans represent one of the most sizable migrant communities in Spain. Yet, unlike other minority groups, they count with longer migration tradition, linguistic and cultural similarities Spanish population, easier access to nationality. Drawing on original data covering a large number candidates ( N = 5,055), this article examines whether apparently favorable configuration guarantees n...

2004
Einar Vollset Paul Ezhilchelvan

The protocol presented here guarantees that at least a specified number, k, of destinations receive a given message. The guarantees are deterministic and the failure probability is zero. Such a strong delivery assurance provides a more powerful primitive than protocols which attempt to minimise failure probability, and is useful for meeting many user-level requirements. Simulations under a wide...

Journal: :Lecture Notes in Computer Science 2022

Many decentralized systems rely on flooding protocols for message dissemination. In such a protocol, the sender of sends it to randomly selected set peers. These peers again send their peers, until every network participant has received message. This type clearly fail in face an adaptive adversary who can simply corrupt all and thereby prevent from being delivered. Nevertheless, are commonly us...

2007
Nishanth R. Sastry Jon Crowcroft Karen R. Sollins

Cities around the world are currently considering building expensive Wi-Fi infrastructure. In urban areas, resident operated Wi-Fi access points (APs) are dense enough to achieve ubiquitous Internet access, provided we can induce the hosts to provide guest Wi-Fi access. However, sharing Wi-Fi involves taking on responsibility for the guest’s actions. Our main contribution is a novel mechanism t...

Journal: :مجله مطالعات حقوق تطبیقی 0
سکینه کرمی استادیار دانشکدۀ علوم انسانی دانشگاه آزاد اسلامی- واحد تهران غرب

deep economic and social developments in two recent centuries beside other important alterations, created important changes in contracting aria among them placing weak and strong parties against each other in contracts. freedom of contract, that before enjoided from some kind of sancity,could not provid contractual justice in this new conditions. therefore adjustment of this tool(contract) in a...

2008
Jon X Eguia Francis Bloch Anna Bogomolnaia Luis Corchon Matias Iaryczower Matt Jackson Andrea Mattozzi

In this paper I study the strategic implications of coalition formation in an assembly. A coalition forms a voting bloc to coordinate the voting behavior of its members, acting as a single player and affecting the policy outcome. In a game of endogenous coalition formation, I show that voting blocs form in equilibrium, and in an assembly with two parties I show how the incentives to join a bloc...

Journal: :IACR Cryptology ePrint Archive 2017
David Cerezo Sánchez

Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. Effectively solving DAO and Gyges attacks, this paper describes an implementation and presents examples to demonstrate its practical viability (e.g., private and verifiable crowdfundings and investment funds, double auctions for ...

Journal: :the international journal of humanities 2007
najleh khandagh

considering the importance of the right wing parties in iranian political history, this article has tried to provide necessary information and discussions, which help us to understand the reasons of their formation and activities in order to fill the vacuum, which exist in this domain. for this purpose, i have tried to analyze three political phases and their relations to the political awarene...

Journal: :SIAM J. Comput. 2015
Iftach Haitner Jonathan J. Hoch Omer Reingold Gil Segev

We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box reduction of a statistically hiding commitment scheme from one-way permutations, and from trapdoor permutations. As a corollary, we derive similar tight lower bounds for several other cryptographic protocols, such as ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید