Results 151 to 160 of about 5,707 (192)

Research on key technologies for privacy-preserving, regulatorily compliant, and cross-chain interoperability in heterogeneous blockchain systems. [PDF]

Sci Rep
Chen Z, Liu H, Zhang L, Dai B, Shi Y.
europepmc   +1 more source

A lightweight attribute-based signcryption scheme based on cloud-fog assisted in smart healthcare. [PDF]

PLoS One
Sun Y, Du X, Niu S, Zhou S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

One-More Unforgeability of Blind ECDSA

Lecture Notes in Computer Science, 2021
In 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.
Xianrui Qin, Tsz Hon Yuen
exaly   +2 more sources

Strong unforgeability in group signature schemes

Computer Standards and Interfaces, 2009
A 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
Haeryong Park, Seongan Lim, Ikkwon Yie, Kitae Kim, Junghwan Song   +4 more
exaly   +2 more sources

BETWEEN FORGIVENESS AND UNFORGIVENESS

The Heythrop Journal, 2010
Although 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

How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature

2006
Standard 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.
Steinfeld, Ron, Pieprzyk, Josef, Wang, Huaxiong   +2 more
openaire   +2 more sources

Strongly unforgeable ID-based signatures without random oracles

International Journal of Applied Cryptography, 2009
In this paper, we construct a strongly unforgeable ID-based signature scheme in the standard model (or without random oracles), with five signature parameters. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie Hellman (DH) problem or the discrete logarithm problem.
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto   +2 more
openaire   +1 more source

Quantum Cryptography, or Unforgeable Subway Tokens

1983
The 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, Gilles Brassard, Seth Breidbart, Stephen Wiesner   +3 more
openaire   +1 more source

Unforgeable Watermarking Schemes with Public Extraction

2018
A watermarking scheme consists of a marking algorithm allowing one to embed some information into a program while preserving its functionality and an extraction algorithm enabling one to extract embedded information from a marked program. The main security properties of watermarking schemes include unremovability and unforgeability.
Rupeng Yang, Man Ho Au, Junzuo Lai, Qiuliang Xu, Zuoxia Yu   +4 more
openaire   +1 more source