Lattice-based verifiable timed signature and application
Tongxin xuebaoAiming 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
Security Amplification of Threshold Signatures in the Standard Model [PDF]
The current standardization calls for threshold signatures have highlighted the need for appropriate security notions providing security guarantees strong enough for broad application. To address this, Bellare et al.
Kristina Hostáková +3 more
core
Provably unforgeable signatures
, 1992 Summary: Digital signatures are one of the more useful applications of cryptography. There are many different signature schemes with varying degrees of security and efficiency. The scheme that has security in the strongest sense (signatures cannot be obtained for a given message, even if other signatures of the forger's choice are available), is rather
openaire +2 more sources
A Framework for Advanced Signature Notions [PDF]
The beyond unforgeability features formalize additional security properties for signature schemes. We develop a general framework of binding properties for signature schemes that encompasses existing beyond unforgeability features and reveals new notions.
Maximiliane Weishäupl, Patrick Struck
core
Scheme on user identity attribute preserving based on ring signcryption for cloud computing
Tongxin 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
forgeability of wang-zhu-feng-yau's attribute-based signature with policy-and-endorsement mechanism
, 2013 Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle ...
Ge Ai-Jun +4 more
core +1 more source
Proxy Signcrypion Scheme Based on Hyper Elliptic Curves
, 2016 Delegation of rights is promising in Internet applications like distributed computing, e-cash systems, global distribution networks, grid computing, mobile agent applications, and mobile communications.
Ullah, Insaf +4 more
core
Pairing-Free Blind Signatures from CDH Assumptions [PDF]
We present the first concurrently-secure blind signatures making black-box use of a pairing-free group for which unforgeability, in the random oracle model, can be proved {\em without} relying on the algebraic group model (AGM), thus resolving a long ...
Rutchathon Chairattana-Apirom +2 more
core
Foundations of Dynamic Group Signatures: The Case of Malicious Openers and Issuers [PDF]
Group signatures enable users to sign on behalf of a group while preserving anonymity, with accountability provided by a designated opener. The first rigorous model for dynamic groups (Bellare, Shi, Zhang, CT--RSA \u2705) captured anonymity, non ...
Stephan Krenn +2 more
core
Enhancing Data Protection in Dynamic Consent Management Systems: Formalizing Privacy and Security Definitions with Differential Privacy, Decentralization, and Zero-Knowledge Proofs. [PDF]
Sensors (Basel), 2023 Khalid MI, Ahmed M, Kim J.
europepmc +1 more source