Results 131 to 140 of about 718 (171)
Some of the next articles are maybe not open access.
One-More Unforgeability of Blind ECDSA
Lecture Notes in Computer Science, 2021In this paper, we give the first formal security analysis on the one-more unforgeability of blind ECDSA. We start with giving a general attack on blind ECDSA, which is similar to the ROS attack on the blind Schnorr signature. We formulate the ECDSA-ROS problem to capture this attack.
Tsz Hon Yuen, Xianrui Qin, Yuen Tsz Hon
exaly +3 more sources
Strong unforgeability in group signature schemes
Computer Standards and Interfaces, 2009A signature scheme is strongly unforgeable if no adversary can produce a new valid signature @s on a message M even after seeing some signatures on M. We define strong unforgeability of group signature schemes and explain why the strong unforgeability of a group signature scheme is necessary. This relatively new security concept was not considered when
Ikkwon Yie, Junghwan Song
exaly +2 more sources
PUDA – Privacy and Unforgeability for Data Aggregation [PDF]
Lecture Notes in Computer Science, 2015 Existing work on secure data collection and secure aggregation is mainly focused on confidentiality issues. That is, ensuring that the untrusted Aggregator learns only the aggregation result without divulging individual data inputs. In this paper however we consider a malicious Aggregator which is not only interested in compromising users’ privacy but ...
Refik Molva, Melek Onen, Onen Melek
exaly +3 more sources
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
2006Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are randomised and allow many possible signatures for a single message.
Ron Steinfeld +2 more
openaire +2 more sources
Certificateless Signature with Strong Unforgeability in the Standard Model
Informatica, 2015 Certificateless public-key systems (CL-PKS) were introduced to simultaneously solve two critical problems in public-key systems. One is the key escrow problem in ID-based public-key systems and the other is to eliminate the presence of certificates in conventional public-key systems.
Yuh-Min Tseng +2 more
exaly +3 more sources
One-More Unforgeability for Multi - and Threshold Signatures
Lecture Notes in Computer ScienceStefano Tessaro, Tessaro Stefano
exaly +3 more sources
User-Mediated Authentication Protocols and Unforgeability in Key Collision
Lecture Notes in Computer Science, 2018This research provides a computational analysis of the ISO 9798-6 standard’s Mechanism 7a authentication protocol. In contrast to typical authentication protocols, ISO 9798-6 mechanism 7a requires user interaction and aims to authenticate data possession instead of identities. Consequently, we introduce a 3-party possession user mediated authentication
Britta Hale, Hale Britta
exaly +3 more sources
BETWEEN FORGIVENESS AND UNFORGIVENESS
The Heythrop Journal, 2010Although demanding and hard to grant, forgiveness has been treasured for centuries because it has the power to heal emotional wounds, restore human relationships and break the chain of violence. Some writers, though, have asserted that forgiveness found its boundaries in Auschwitz; the Nazi crimes against humanity reached the pinnacle there and cannot ...
openaire +1 more source
The Idiot as a Tragedy of Unforgiveness
2020Dostoevsky Studies, Vol 23 (2020)
openaire +1 more source
Quantum Cryptography, or Unforgeable Subway Tokens
1983The use of quantum mechanical systems, such as polarized photons, to record information gives rise to novel cryptographic phenomena, not achievable with classical recording media: 1) A Verify Only Memory (VOM) that, with high probability, cannot be read or copied by someone ignorant of its contents; 2) the multiplexing of two messages in such a way ...
Charles H. Bennett +3 more
openaire +1 more source