Zitieren
1.
Uzunkol O, Kalkar Öznur, Sertkaya I. Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction. 2017;2017:1173+. http://eprint.iacr.org/2017/1173.
Uzunkol, O. ., Kalkar, Öznur ., & Sertkaya, I. . (2017). Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction. Abgerufen von http://eprint.iacr.org/2017/1173
Uzunkol, Osmanbey, Öznur Kalkar, und Isa Sertkaya. 2017. „Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction“. http://eprint.iacr.org/2017/1173.
Uzunkol, Osmanbey, Öznur Kalkar, und Isa Sertkaya. „Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction“. 2017: 1173+.
Uzunkol, Osmanbey, u. a. Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction. Bd. 2017, 2017, S. 1173+, http://eprint.iacr.org/2017/1173.
Details
-
Volume
2017 -
Number of Pages
1173+ -
URL
http://eprint.iacr.org/2017/1173