Results 41 to 50 of about 359 (179)

Bound by blood and bloodshed: Sibling ties and participation in genocidal violence

open access: yesCriminology, EarlyView.
Abstract Focusing on the 1994 genocide in Rwanda, we examine how sibling relationships—one of the most salient familial bonds—influence individual engagement in violence during mass atrocity. Drawing on an adaptation of differential association and social learning theories for contexts of mass atrocity, we analyze a novel dataset linking over 300,000 ...
Jack G. R. Wippell   +3 more
wiley   +1 more source

A “Tech First” Approach to Foreign Policy? The Three Meanings of Tech Diplomacy

open access: yesGlobal Policy, EarlyView.
ABSTRACT Scholars have recently argued that international politics is plagued by instability as the world rapidly transitions from one crisis to another. This state of “Permacrisis,” or permanent crises between states, is driven by technological innovations which create new kinds of crises and drive competitions between adversarial states.
Ilan Manor
wiley   +1 more source

When First Nations Don't Count: H.V. Evatt and the Erasure of Palestinian Rights

open access: yesAustralian Journal of Politics &History, EarlyView.
As Minister for External Affairs in the Chifley Government, Herbert Vere Evatt played a pivotal role at the United Nations in securing the partition of Palestine and recognition of the State of Israel. These endeavours were represented by Evatt and in subsequent commentary as exemplifying Evatt's commitment to justice.
Jeff Rickertt
wiley   +1 more source

Security analysis of GCM for communication

open access: yes, 2014
The Galois/Counter Mode of operations (GCM) is constructed by combining the counter mode encryption and the authentication component (i.e., GTAG) to provide both privacy and authenticity. GTAG can be used as a stand-alone message authentication code.
Yap, Wun She   +3 more
core   +1 more source

New Generic Attacks Against Hash-based MACs [PDF]

open access: yes, 2013
. In this paper we study the security of hash-based MAC algorithms (such as HMAC and NMAC) above the birthday bound. Up to the birthday bound, HMAC and NMAC are proven to be secure under reasonable assumptions on the hash function.
Gaëtan Leurent, Lei Wang, Thomas Peyrin
core   +1 more source

The Credibility of Bioethics After the Gaza Genocide

open access: yesBioethics, EarlyView.
ABSTRACT Between October 2023 and January 2025, the Israeli military's sustained attacks on Gaza resulted in an estimated 186,000 deaths and the systematic destruction of healthcare infrastructure. Despite the professed commitment to human dignity, justice, and the minimization of suffering within bioethics, major institutions and scholars in the field
Maide Barış   +4 more
wiley   +1 more source

Attack on Kang et al.\u27s Identity-Based Strong Designated Verifier Signature Scheme [PDF]

open access: yes, 2008
In this paper, we present a universal forgery attack on Kang et al.\u27s identity-based strong designated verifier signature (IBSDVS) scheme. We show anyone can forge a valid IBSDVS on an arbitrary message without the knowledge of the private key of ...
Qiaoyan Wen, Hongzhen Du
core  

On the Security of Digital Signature Schemes Based on Error-Correcting Codes [PDF]

open access: yes, 2003
We discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the ...
Doumen, Jeroen   +5 more
core   +1 more source

Security of Wang-Li Threshold Signature Scheme [PDF]

open access: yes, 2004
In 2003, Wang et al.[1] proposed a (t, n) threshold signature scheme without a trusted party based on the discrete logarithm problem. In this paper, according to [5]'s attacking method, we show that there are still some security leaks in that scheme,
Lifeng Guo
core  

Practical Forgeries and Distinguishers against PAES

open access: yes, 2016
We present two practical attacks on the CAESAR candidate PAES. The first attack is a universal forgery for any plaintext with at least 240 bytes. It works for the nonce-repeating variant of PAES and in a nutshell it is a state recovery based on solving ...
Jean, Jérémy   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy