Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them

Matteo Campanelli, Dario Fiore 0001, Rosario Gennaro. Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. J. Cryptology, 38(1):14, March 2025. [doi]

@article{CampanelliFG25,
  title = {Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them},
  author = {Matteo Campanelli and Dario Fiore 0001 and Rosario Gennaro},
  year = {2025},
  month = {March},
  doi = {10.1007/s00145-024-09535-0},
  url = {https://doi.org/10.1007/s00145-024-09535-0},
  researchr = {https://researchr.org/publication/CampanelliFG25},
  cites = {0},
  citedby = {0},
  journal = {J. Cryptology},
  volume = {38},
  number = {1},
  pages = {14},
}