Computationally Sound Analysis of Protocols Using Bilinear Pairings

Journal of Computer Security - Netherlands
doi 10.3233/jcs-2009-0388
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Generalized ID-based Blind Signatures From Bilinear Pairings

2008English

An Efficient ID-based Proxy Signcryption Scheme Without Bilinear Pairings

International Journal of Computer Applications
2013English

An Identity-Based Ring Signature Scheme From Bilinear Pairings

English

An Efficient and Provably-Secure Certificateless Signature Scheme Without Bilinear Pairings

International Journal of Communication Systems
Electronic EngineeringCommunicationsElectricalComputer Networks
2011English

Two Group Signature Schemes With Multiple Strategies Based on Bilinear Pairings

International Journal of Information Technology and Computer Science
2009English

Computationally Sound Mechanized Proofs for Deniable Authentication Protocols With a Probabilistic Polynomial Calculus in Computational Model

Information Technology Journal
2011English

Identity-Based Data Integrity Checking in Public Cloud With Bilinear Pairings

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

One-Pass Authenticated Key Establishment Protocol on Bilinear Pairings for Wireless Sensor Networks

2014English

A Secure and an Efficient ID-based Multi-Proxy Multi-Signature Scheme From Bilinear Pairings

International Journal of Computer Applications
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy