Secure fast evaluation of iterative methods: with an application to secure PageRank

DOI10.1007/978-3-030-75539-3_1OpenAlexW3158255070MaRDI QIDQ826235

Younes Talibi Alaoui, Daniele Cozzo, Nigel P. Smart

Publication date: 20 December 2021

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/675010

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Private liquidity matching using MPC

Cites Work

• Notes on the second largest eigenvalue of a graph
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues and expanders
• Adaptive methods for the computation of PageRank
• Reducing communication channels in MPC
• Multiparty Computation from Somewhat Homomorphic Encryption
• How to share a secret
• Deeper Inside PageRank
• A converse to Banach's fixed point theorem and its CLS-completeness
• Algorithms and Models for the Web-Graph
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

This page was built for publication: Secure fast evaluation of iterative methods: with an application to secure PageRank