Amanote Research

Amanote Research

    RegisterSign In

Generic Constructions for Verifiable Signcryption

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31912-9_14
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2012

Authors
Laila El Aimani
Publisher

Springer Berlin Heidelberg


Related search

Lower Bounds on the Efficiency of Generic Cryptographic Constructions

English

Verifiable Visualization for Isosurface Extraction

IEEE Transactions on Visualization and Computer Graphics
Computer GraphicsPattern RecognitionComputer VisionComputer-Aided DesignSignal ProcessingSoftware
2009English

Security With Signcryption

SSRN Electronic Journal
2014English

Verifiable Voting Systems

2013English

From Stateless to Stateful: Generic Authentication and Authenticated Encryption Constructions With Application to TLS

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Signcryption Scheme Based on SCHNORR Digital Signature

International Journal of Peer to Peer Networks
2012English

Effective Signcryption Approach for Secure Convention for Multilayer Consensus Using ECC

International Journal of Security and its Applications
Computer Science
2016English

Verifiable Protocol Design for Agent Argumentation Dialogues

2009English

Vital Verifiable CPD – Instructions

Vital
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy