References in zbMATH (referenced in 12 articles , 1 standard article )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Ben-Sasson, Eli; Bentov, Iddo; Chiesa, Alessandro; Gabizon, Ariel; Genkin, Daniel; Hamilis, Matan; Pergament, Evgenya; Riabzev, Michael; Silberstein, Mark; Tromer, Eran; Virza, Madars: Computational integrity with a public random string from quasi-linear PCPs (2017)
  2. Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars: Scalable zero knowledge via cycles of elliptic curves (2017)
  3. Mohassel, Payman; Rosulek, Mike; Scafuro, Alessandra: Sublinear zero-knowledge arguments for RAM programs (2017)
  4. Veeningen, Meilof: Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation (2017)
  5. Albrecht, Martin; Grassi, Lorenzo; Rechberger, Christian; Roy, Arnab; Tiessen, Tyge: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity (2016)
  6. Fiore, Dario; Nitulescu, Anca: On the (in)security of SNARKs in the presence of oracles (2016)
  7. Ishai, Yuval; Weiss, Mor; Yang, Guang: Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits (2016)
  8. Papamanthou, Charalampos; Tamassia, Roberto; Triandopoulos, Nikos: Authenticated hash tables based on cryptographic accumulators (2016)
  9. Schoenmakers, Berry; Veeningen, Meilof; de Vreede, Niels: Trinocchio: privacy-preserving outsourcing by distributed verifiable computation (2016)
  10. Chiesa, Alessandro; Zhu, Zeyuan Allen: Shorter arithmetization of nondeterministic computations (2015)
  11. Fauzi, Prastudy; Lipmaa, Helger; Zhang, Bingsheng: Efficient non-interactive zero knowledge arguments for set operations (2014) ioport
  12. Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran; Virza, Madars: Snarks for C: verifying program executions succinctly and in zero knowledge (2013)