Secure fast evaluation of iterative methods: with an application to secure PageRank
type: Item
instance of: scholarly article
title: Secure fast evaluation of iterative methods: with an application to secure PageRank
DOI: 10.1007/978-3-030-75539-3_1
author: Daniele Cozzo
author: N. P. Smart
author: Younes Talibi Alaoui
publication date: 2021-12-20T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/675010
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7449870
MaRDI profile type: Publication
OpenAlex ID: W3158255070
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Eigenvalues and expanders
cites work: Algorithms and Models for the Web-Graph
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: A converse to Banach's fixed point theorem and its CLS-completeness
cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
cites work: Adaptive methods for the computation of PageRank
cites work: Reducing communication channels in MPC
cites work: Deeper Inside PageRank
cites work: How to share a secret
cites work: Notes on the second largest eigenvalue of a graph
Recommended article: Advances in Cryptology - EUROCRYPT 2004
Recommended article: Topics in Cryptology – CT-RSA 2006
Recommended article: On efficient randomized algorithms for finding the PageRank vector
Recommended article: Q5259955
Recommended article: The coupled iteration algorithms for computing PageRank
Recommended article: Several relaxed iteration methods for computing PageRank
Recommended article: On Accelerating the PageRank Computation
Recommended article: On convergence of the inner-outer iteration method for computing Pagerank
Recommended article: On the multi-splitting iteration method for computing PageRank
description: scientific article; zbMATH DE number 7449870