R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai, "Universally composable two-party and multi-party secure computation, " in STOC 2002, pp. 494-503.
W. Aiello, Y. Ishai, and O. Reingold, "Priced oblivious transfer: How to sell digital goods, " in EUROCRYPT 2001, pp. 119-135.
A. Rial and G. Danezis, "Privacy-preserving smart metering, " in WPES 2011, pp. 49-60.
M. Herrmann, A. Rial, C. Díaz, and B. Preneel, "Practical privacypreserving location-sharing based services with aggregate statistics, " in WiSec'14, pp. 87-98.
J. Camenisch, M. Dubovitskaya, and A. Rial, "UC commitments for modular protocol design and applications to revocation and attribute tokens, " in CRYPTO 2016, pp. 208-239.
B. Libert and M. Yung, "Concise mercurial vector commitments and independent zero-knowledge sets with short proofs, " in TCC 2010, pp. 499-517.
D. Catalano and D. Fiore, "Vector commitments and their applications, " in PKC 2013, pp. 55-72.
P. Mohassel, M. Rosulek, and A. Scafuro, "Sublinear zero-knowledge arguments for RAM programs, " in EUROCRYPT 2017, pp. 501-531.
Z. Hu, P. Mohassel, and M. Rosulek, "Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost, " in CRYPTO 2015, pp. 150-169.
J. Camenisch and A. Lysyanskaya, "An efficient system for nontransferable anonymous credentials with optional anonymity revocation, " in EUROCRYPT 2001, pp. 93-118.
A. Rial, M. Kohlweiss, and B. Preneel, "Universally composable adaptive priced oblivious transfer, " in Pairing 2009, pp. 231-247.
A. Kate, G. M. Zaverucha, and I. Goldberg, "Constant-size commitments to polynomials and their applications, " in ASIACRYPT 2010, pp. 177-194.
B. Libert, S. C. Ramanna, and M. Yung, "Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions, " in ICALP 2016, pp. 30:1-30:14.
M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn, "Malleable proof systems and applications, " in EUROCRYPT 2012, pp. 281-300.
S. Micali, M. O. Rabin, and J. Kilian, "Zero-knowledge sets, " in FOCS 2003, pp. 80-91.
M. Chase, A. Healy, A. Lysyanskaya, T. Malkin, and L. Reyzin, "Mercurial commitments with applications to zero-knowledge sets, " J. Cryptology, vol. 26, no. 2, pp. 251-279, 2013.
D. Catalano, D. Fiore, and M. Messina, "Zero-knowledge sets with short proofs, " in EUROCRYPT 2008, pp. 433-450.
M. Liskov, "Updatable zero-knowledge databases, " in ASIACRYPT 2005, 2005, pp. 174-198.
E. Ghosh, O. Ohrimenko, and R. Tamassia, "Zero-knowledge authenticated order queries and order statistics on a list, " in ACNS 2015, pp. 149-171.
E. Ghosh, M. T. Goodrich, O. Ohrimenko, and R. Tamassia, "Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees, " in SCN 2016, pp. 216-236.
R. Ostrovsky, C. Rackoff, and A. D. Smith, "Efficient consistency proofs for generalized queries on a committed database, " in ICALP 2004, pp. 1041-1053.
S. Goldberg, M. Naor, D. Papadopoulos, L. Reyzin, S. Vasant, and A. Ziv, "NSEC5: provably preventing DNSSEC zone enumeration, " in NDSS 2015, 2015.
J. Camenisch, M. Dubovitskaya, and A. Rial, "Concise uc zeroknowledge proofs for oblivious updatable databases, " 2019. [Online]. Available: http://hdl. handle. net/10993/39423
R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols, " Cryptology ePrint Archive, Report 2000/067, 2000, https://eprint. iacr. org/2000/067.
-, "Universally composable security: A new paradigm for cryptographic protocols, " in FOCS 2001, pp. 136-145.
J. Camenisch, S. Krenn, and V. Shoup, "A framework for practical universally composable zero-knowledge protocols, " in ASIACRYPT 2011, pp. 449-467.
S. Goldwasser, S. Micali, and R. L. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks, " SIAM J. Comput., vol. 17, no. 2, pp. 281-308, 1988.
M. Abe, J. Groth, K. Haralambiev, and M. Ohkubo, "Optimal structurepreserving signatures in asymmetric bilinear groups, " in CRYPTO 2011, pp. 649-666.
T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing, " in CRYPTO '91, pp. 129-140.
J. Camenisch, M. Dubovitskaya, and G. Neven, "Unlinkable priced oblivious transfer with rechargeable wallets, " in FC 2010, pp. 66-81.
A. Damodaran, M. Dubovitskaya, and A. Rial, "UC priced oblivious transfer with purchase statistics and dynamic pricing, " in INDOCRYPT 2019, pp. 273-296.
J. C. Benaloh and M. de Mare, "One-way accumulators: A decentralized alternative to digital sinatures (extended abstract), " in EUROCRYPT '93, pp. 274-285.
B. Libert, T. Peters, and M. Yung, "Group signatures with almost-for-free revocation, " in CRYPTO 2012, pp. 571-589.
M. Izabachène, B. Libert, and D. Vergnaud, "Block-wise p-signatures and non-interactive anonymous credentials with efficient attributes, " in Cryptography and Coding-13th IMA International Conference, IMACC 2011, pp. 431-450.
M. Kohlweiss and A. Rial, "Optimally private access control, " in WPES 2013, pp. 37-48.
R. W. F. Lai and G. Malavolta, "Subvector commitments with application to succinct arguments, " in CRYPTO 2019, pp. 530-560.
D. Boneh, B. Bünz, and B. Fisch, "Batching techniques for accumulators with applications to iops and stateless blockchains, " in CRYPTO 2019, pp. 561-586.
M. Chase and I. Visconti, "Secure database commitments and universal arguments of quasi knowledge, " in CRYPTO 2012, pp. 236-254.
A. Damodaran and A. Rial, "UC updatable databases and applications, " in AFRICACRYPT 2020, pp. 66-87.
-, "Unlinkable updatable databases and oblivious transfer with access control, " in ACISP 2020, pp. 584-604.
J. Kilian, "A note on efficient zero-knowledge proofs and arguments (extended abstract), " in STOC 1992, pp. 723-732.
R. Gennaro, C. Gentry, B. Parno, and M. Raykova, "Quadratic span programs and succinct nizks without pcps, " in EUROCRYPT 2013, pp. 626-645.
