vector commitments; universal composability; priced oblivious transfer
Résumé :
[en] Priced oblivious transfer (POT) is a cryptographic protocol that can be used to protect customer privacy in e-commerce applications.
Namely, it allows a buyer to purchase an item from a seller without disclosing to the latter which item was purchased and at which price.
Unfortunately, existing POT schemes have some drawbacks in terms of design and functionality.
First, the design of existing POT schemes is not modular.
Typically, a POT scheme extends a k-out-of-N oblivious transfer (OT) scheme by adding prices to the items.
However, all POT schemes do not use OT as a black-box building block with certain security guarantees.
Consequently, security of the OT scheme needs to be reanalyzed while proving security of the POT scheme, and it is not possible to swap the underlying OT scheme with any other OT scheme.
Second, existing POT schemes do not allow the seller to obtain any kind of statistics about the buyer's purchases, which hinders customer and sales management.
Moreover, the seller is not able to change the prices of items without restarting the protocol from scratch.
We propose a POT scheme that addresses the aforementioned drawbacks.
We prove the security of our POT in the UC framework.
We modify a standard POT functionality to allow the seller to receive aggregate statistics about the buyer's purchases and to change prices dynamically.
We present a modular construction for POT that realizes our functionality in the hybrid model.
One of the building blocks is an ideal functionality for OT.
Therefore, our protocol separates the tasks carried out by the underlying OT scheme from the additional tasks needed by a POT scheme.
Thanks to that, our protocol is a good example of modular design and can be instantiated with any secure OT scheme as well as other building blocks without reanalyzing security from scratch.
Centre de recherche :
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119–135. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44987-6 8
Biesmans, W., Balasch, J., Rial, A., Preneel, B., Verbauwhede, I.: Private mobile pay-tv from priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 13(2), 280–291 (2018)
Blazy, O., Chevalier, C., Germouty, P.: Adaptive oblivious transfer and generalization. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 217–247. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53890-6 8
Camenisch, J., Dubovitskaya, M., Enderlein, R.R., Neven, G.: Oblivious transfer with hidden access control from attribute-based encryption. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 559–579. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32928-9 31
Camenisch, J., Dubovitskaya, M., Neven, G.: Oblivious transfer with access control. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 131–140. ACM (2009)
Camenisch, J., Dubovitskaya, M., Neven, G.: Unlinkable priced oblivious transfer with rechargeable wallets. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 66–81. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14577-3 8
Camenisch, J., Dubovitskaya, M., Neven, G., Zaverucha, G.M.: Oblivious transfer with hidden access control policies. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 192–209. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19379-8 12
Camenisch, J., Dubovitskaya, M., Rial, A.: Concise UC zero-knowledge proofs for oblivious updatable databases. http://hdl.handle.net/10993/39423
Camenisch, J., Dubovitskaya, M., Rial, A.: UC commitments for modular protocol design and applications to revocation and attribute tokens. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 208–239. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53015-3 8
Biesmans, W., Balasch, J., Rial, A., Preneel, B., Verbauwhede, I.: Private mobile pay-tv from priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 13(2), 280–291 (2018)
Biesmans, W., Balasch, J., Rial, A., Preneel, B., Verbauwhede, I.: Private mobile pay-tv from priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 13(2), 280–291 (2018)
Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136–145. IEEE (2001)
Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 494–503. ACM (2002)
Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265–281. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45146-4 16
Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55–72. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36362-7 5
Biesmans, W., Balasch, J., Rial, A., Preneel, B., Verbauwhede, I.: Private mobile pay-tv from priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 13(2), 280–291 (2018)
Damodaran, A., Dubovitskaya, M., Rial, A.: UC priced oblivious transfer with purchase statistics and dynamic pricing. http://hdl.handle.net/10993/39424
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. Technical report, Naval Research Lab Washington DC (2004)
Henry, R., Olumofin, F., Goldberg, I.: Practical PIR for electronic commerce. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 677–690. ACM (2011)
Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Adaptive oblivious transfer with access control from lattice assumptions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 533–563. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70694-8 19
Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499–517. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11799-2 30
Rial, A., Balasch, J., Preneel, B.: A privacy-preserving buyer-seller watermarking protocol based on priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 6(1), 202–212 (2011)
Rial, A., Kohlweiss, M., Preneel, B.: Universally composable adaptive priced oblivious transfer. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 231–247. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03298-1 15
Rial, A., Preneel, B.: Optimistic fair priced oblivious transfer. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 131–147. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12678-9 9
Zhang, Y., et al.: Oblivious transfer with access control: realizing disjunction without duplication. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 96–115. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17455-1 7
