Efficient algorithms for secure outsourcing of bilinear pairings
From MaRDI portal
Publication:476851
DOI10.1016/j.tcs.2014.09.038zbMath1303.68050OpenAlexW2010094835MaRDI QIDQ476851
Qiang Tang, Duncan S. Wong, Xiaofeng Chen, Willy Susilo, Shaohua Tang, Jin Li, Jian-Feng Ma
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.038
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Blockchain-based system for secure outsourcing of bilinear pairings ⋮ Verifiable outsourced ciphertext-policy attribute-based encryption in cloud computing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- Efficient signature generation by smart cards
- Self-testing/correcting with applications to numerical problems
- Efficient pairing computation on supersingular abelian varieties
- New Algorithms for Secure Outsourcing of Modular Exponentiations
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Batch Pairing Delegation
- The Eta Pairing Revisited
- Secure Delegation of Elliptic-Curve Pairing
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Verifiable Delegation of Computation over Large Datasets
- Server-Aided Verification: Theory and Practice
- Theory of Cryptography
- Cryptography and Coding
This page was built for publication: Efficient algorithms for secure outsourcing of bilinear pairings
