Results 71 to 80 of about 2,165 (141)

Lattice-based verifiably encrypted group signatures

open access: yesCybersecurity
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

A Proxy Re-Encryption Scheme with the Unforgeability of Re-Encryption Keys against Collusion Attacks [PDF]

open access: yes, 2014
Proxy re-encryption (PRE) schemes are cryptosystems which allow a proxy who has a re-encryption key to convert a ciphertext originally encrypted for one party into a ciphertext which can be decrypted by another party. In [1], Hayashi et al.
Tatsuyuki Matsushita, Ryotaro Hayashi
core   +1 more source

Attribute-based alterable threshold ring signature scheme with conspiracy attack immunity

open access: yesTongxin xuebao, 2015
Attribute-based cryptography is a generalization and development of the identity-based cryptography,which extends the identity to a set of attributes.In the attribute-based cryptosystem,different members with the same attributes can form a signature ring
Zhen CHEN, Wen-fang ZHANG, Xiao-min WANG
doaj   +2 more sources

Lattice-based verifiable timed signature and application

open access: yesTongxin xuebao
Aiming at the problem that current verifiable timed signature (VTS) schemes cannot effectively resist the threat of quantum computing attacks, a lattice-based verifiable timed signature (LVTS) scheme was proposed, founded on challenging problems over ...
CHEN Huiyan   +4 more
doaj  

Scheme on user identity attribute preserving based on ring signcryption for cloud computing

open access: yesTongxin xuebao, 2014
Identity attribute leak as the most severe security threat of cloud computing,in order to solve this problem,a protection scheme of identity attributes based on ring signcryption was proposed.Focused on digital identity management in cloud service,which ...
Shuan-bao LI   +5 more
doaj  

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

open access: yes, 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  

Proxying Is Enough: Security of Proxying in TLS Oracles and AEAD Context Unforgeability [PDF]

open access: yes
TLS allows a client to securely obtain data from a server, but does not allow the client to offer the data provenance to an external node. TLS oracle protocols are used to solve the problem.
Aniket Kate   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy