Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting

Canard, Sébastien; Pointcheval, David; Sanders, Olivier

doi:10.1007/978-3-642-54631-0_10

Cited by 2 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Trusted Computing (TC) is a security mechanism for IaaS where execution of a virtual machine (VM) instance can be run in a secure manner. On the other hand, the virtual machines need to be up to date from the view of both the CSP and the customer side (Proudler et al 2014;Canard et al 2014). …”

Section: Guarantee Of Imagementioning

confidence: 99%

A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing

Kiraz

2016

J Ambient Intell Human Comput

View full text Add to dashboard Cite

The concept of cloud computing offers measurable computational or information resources as a service over the Internet. The major motivation behind the cloud setup is economic benefits, because it assures the reduction in expenditure for operational and infrastructural purposes. To transform it into a reality there are some impediments and hurdles which are required to be tackled, most profound of which are security, privacy and reliability issues. As the user data is revealed to the cloud, it departs the protection-sphere of the data owner. However, this brings partly new security and privacy concerns. This work focuses on these issues related to various cloud services and deployment models by spotlighting their major challenges. While the classical cryptography is an ancient discipline, modern cryptography, which has been mostly developed in the last few decades, is the subject of study which needs to be implemented so as to ensure strong security and privacy mechanisms in today's real-world scenarios. The technological solutions, short and long term research goals of the cloud security will be described and addressed using various classical cryptographic mechanisms as well as modern ones. This work explores the new directions in cloud computing security, while highlighting the correct selection of these fundamental technologies from cryptographic point of view.

show abstract

Section: Guarantee Of Imagementioning

confidence: 99%

A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing

Kiraz

2016

J Ambient Intell Human Comput

View full text Add to dashboard Cite

show abstract

“…However, this scheme is not compatible with the TPM 2.0 specification [5]. Canard et al [31] proposed an efficient approach to delegate some computation of the TPM to the host in interactive zeroknowledge proofs of knowledge. Using their method to the proof of knowledge for pseudonymous signatures in the DAA scheme [20], they show that the online signing cost of TPM can be reduced to one exponentiation.…”

Section: Related Workmentioning

confidence: 99%

“…For the case of bsn = ⊥, we propose a technique of delegable pseudonyms, which is inspired by Canard et al's method [31] on delegation of zero-knowledge proofs of knowledge. Specifically, a pseudonym on a basename bsn is computed as K = e(ḡ, H G2 (bsn)) gsk , where H G2 : {0, 1} * → G 2 is a random oracle.…”

Section: A High-level Ideasmentioning

confidence: 99%

Direct Anonymous Attestation With Optimal TPM Signing Efficiency

Yang

Chen

Zhang

et al. 2021

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Direct Anonymous Attestation (DAA) is an anonymous signature scheme, which allows the Trusted Platform Module (TPM), a small chip embedded in a host computer, to attest to the state of the host system, while preserving the privacy of the user. DAA provides two signature modes: fully anonymous signatures and pseudonymous signatures. One main goal of designing DAA schemes is to reduce the TPM signing workload as much as possible, as the TPM has only limited resources. In an optimal DAA scheme, the signing workload on the TPM will be no more than that required for a normal signature like ECSchnorr. To date, no scheme has achieved the optimal signing efficiency for both signature modes.In this paper, we propose the first DAA scheme which achieves the optimal TPM signing efficiency for both signature modes. In this scheme, the TPM takes only a single exponentiation to generate a signature, and this single exponentiation can be precomputed. Our scheme can be implemented using the existing TPM 2.0 commands, and thus is compatible with the TPM 2.0 specification. We benchmarked the TPM 2.0 commands needed for three DAA use cases on an Infineon TPM 2.0 chip, and also implemented the host signing and verification algorithm for our DAA scheme on a laptop with 1.80GHz Intel Core i7-8550U CPU. Our experimental results show that our DAA scheme obtains a total signing time of about 144 ms for either signature mode, while with pre-computation we can obtain a signing time of about 65 ms. Based on our benchmark results for the pseudonymous signature mode, our scheme is roughly 2× (resp., 5×) faster than the existing DAA schemes supported by TPM 2.0 in terms of total (resp., online) signing efficiency.

show abstract

Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting

Cited by 2 publications

References 27 publications

A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing

A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing

Direct Anonymous Attestation With Optimal TPM Signing Efficiency

Contact Info

Product

Resources

About