Direkt zum Inhalt

A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations

Zitieren

1.
Moritz S, Uzunkol O. A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations. In: Lecture Notes in Computer Science. Springer International Publishing; 2018:74-93. doi:10.1007/978-3-030-03712-3_7.
Moritz, S. ., & Uzunkol, O. . (2018). A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations. In Lecture Notes in Computer Science (S. 74–93). Springer International Publishing. http://doi.org/10.1007/978-3-030-03712-3_7
Moritz, Stephan, und Osmanbey Uzunkol. 2018. „A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations“. In Lecture Notes in Computer Science, 74-93. Springer International Publishing. doi:10.1007/978-3-030-03712-3_7.
Moritz, Stephan, und Osmanbey Uzunkol. „A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations“. Lecture Notes in Computer Science. Springer International Publishing, 2018. 74–93.
Moritz, Stephan, und Osmanbey Uzunkol. „A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations“. Lecture Notes in Computer Science, Springer International Publishing, 2018, S. 74–93.

Details

  • Number of Pages

    74-93
  • Publisher

    Springer International Publishing