Results 81 to 90 of about 1,614 (201)

A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings

Journal of Applied Mathematics, 2014
As people in modern societies are busier than any human era and computer network has profound impact on how people work and live through fast and convenient information exchange, people need more help from each other to accomplish more work via network ...
Nai-Wei Lo, Jia-Lun Tsai
doaj   +1 more source

Certificateless Anonymous Authentication Scheme Supporting Illegal Signatures Localization for Internet of Vehicles [PDF]

Jisuanji gongcheng
In the Internet of Vehicles (IoV) environment, vehicles are connected to public networks through the Internet and information is vulnerable to various malicious attacks from attackers during transmission.
YANG Xiaodong, LI Muzi, MA Guozu, LI Songyu, WANG Caifen
doaj   +1 more source

Machine-Checking Unforgeability Proofs for Signature Schemes with Tight Reductions to the Computational Diffie-Hellman Problem

, 2020
Digital signatures based on the Discrete Logarithm (DL) problem often suffer from long signature sizes, and reductions made loose by the use of Pointcheval and Stern's Forking Lemma.At EUROCRYPT 2003, Goh and Jarecki provided the first forking-free proof
Zain, Sara, Dupressoir, François
core  

Strongly Unforgeable Ring Signature Scheme from Lattices in the Standard Model

Journal of Applied Mathematics, 2014
In a ring signature scheme, a user selects an arbitrary ring to be able to sign a message on behalf of the ring without revealing the signer’s identity. Whistle-blowers especially find this useful.
Geontae Noh, Ji Young Chun, Ik Rae Jeong
doaj   +1 more source

ID-based transitive signature schemes without random oracle

Tongxin xuebao, 2010
Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1, GU Li-ze1, CUI Wei4, YANG Yi-xian1, HU Zheng-ming1   +4 more
doaj   +2 more sources

Lattice-based verifiably encrypted group signatures

Cybersecurity
Verifiably encrypted signature (VES) schemes are extensively utilized in fair exchange which combine the features of encryption and signature, aiming to provide a solution that can not only verify the validity of signatures but also safeguard the privacy
Peidong Guan, Shuai Wang
doaj   +1 more source

Dictators? Friends? Forgers. Breaking and Fixing Unforgeability Definitions for Anamorphic Signature Schemes [PDF]

Anamorphic signature schemes (KPPYZ, Crypto 2023) allow users to hide encrypted messages in signatures to allow covert communication in a hypothesized scenario where encryption is outlawed by a dictator but authentication is permitted.
Roy Stracovsky, Joseph Jaeger
core  

Introducing two ROS attack variants: breaking one-more unforgeability of BZ blind signatures [PDF]

In 2023, Barreto and Zanon proposed a three-round Schnorr-like blind signature scheme, leveraging zero-knowledge proofs to produce one-time signatures as an intermediate step of the protocol.
Lucas C. Cardoso, Paulo S. Barreto, Marcos A. Simplicio Jr, Bruno M. F. Ricardo, Leonardo T. Kimura   +4 more
core  

Bird of Prey: Practical Signature Combiners Preserving Strong Unforgeability

Following the announcement of the first winners of the NIST post-quantum cryptography standardization process in 2022, cryptographic protocols are now undergoing migration to the newly standardized schemes.
Jonas Janneck
core  

Unforgeability in Stochastic Gradient Descent

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023
Teodora Baluta, Ivica Nikolic, Racchit Jain, Divesh Aggarwal, Prateek Saxena   +4 more
openaire   +1 more source