Skip to main content

POSTER: PriAuct: Privacy Preserving Auction Mechanism

  • Conference paper
  • First Online:
Applied Cryptography and Network Security Workshops (ACNS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13907))

Included in the following conference series:

  • 370 Accesses

Abstract

Most of the emerging services and workflows use infrastructure across multiple organizations. This work proposes a privacy-preserving auction mechanism to facilitate cost efficiencies while minimizing the exposure of operational aspects like QoS parameters. It leverages homomorphic encryption using bilinear pairing, to improve bids privacy. Only the winning bid is publicly disclosed. The mechanism provides public auditability and collusion resistance. Measurements of performance overheads, through simulation in various scenarios, are discussed. Basic security proof is also provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zou, S., et al.: Resource allocation game under double-sided auction mechanism: Efficiency and convergence. IEEE Trans. Autom. Control 63(5), 1273–1287 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, C., et al.: Distributed federated service chaining: a scalable and cost-aware approach for multi-domain networks. Comput. Netw. 212, 109044 (2022)

    Article  Google Scholar 

  3. Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78967-3_24

    Chapter  Google Scholar 

  4. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-30576-7_18

    Chapter  Google Scholar 

  5. Faber, R.L.: Foundations of Euclidean and Non-Euclidean Geometry. Dekker, New York (1983)

    MATH  Google Scholar 

  6. Gao, W., et al.: Privacy-preserving auction for big data trading using homomorphic encryption. IEEE Trans. Netw. Sci. Eng. 7(2), 776–791 (2018)

    Article  Google Scholar 

  7. Liu, B., et al.: PANDA: privacy-aware double auction for divisible resources without a mediator. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (2020)

    Google Scholar 

  8. Cheng, K., et al.: Towards efficient privacy-preserving auction mechanism for two-sided cloud markets. In: ICC 2019–2019 IEEE International Conference on Communications (ICC). IEEE (2019)

    Google Scholar 

  9. Chen, Guoxing, et al. “SgxPectre: stealing intel secrets from SGX enclaves via speculative execution. In: 2019 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Neha Joshi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Joshi, N., Thakur, A., Franklin, A.A. (2023). POSTER: PriAuct: Privacy Preserving Auction Mechanism. In: Zhou, J., et al. Applied Cryptography and Network Security Workshops. ACNS 2023. Lecture Notes in Computer Science, vol 13907. Springer, Cham. https://doi.org/10.1007/978-3-031-41181-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-41181-6_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-41180-9

  • Online ISBN: 978-3-031-41181-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics