scholarly journals Super-Efficient Verification of Dynamic Outsourced Databases

2008 ◽  
pp. 407-424 ◽  
Author(s):  
Michael T. Goodrich ◽  
Roberto Tamassia ◽  
Nikos Triandopoulos
Keyword(s):  
Efficient Verification ◽  
Outsourced Databases

scholarly journals Partially materialized digest scheme: an efficient verification method for outsourced databases

2008 ◽  
Vol 18 (1) ◽  
pp. 363-381 ◽  
Author(s):  
Kyriakos Mouratidis ◽  
Dimitris Sacharidis ◽  
HweeHwa Pang
Keyword(s):  
Verification Method ◽  
Efficient Verification ◽  
Outsourced Databases

scholarly journals Efficient Verification of Dicke States

2019 ◽  
Vol 12 (4) ◽  
Author(s):  
Ye-Chao Liu ◽  
Xiao-Dong Yu ◽  
Jiangwei Shang ◽  
Huangjun Zhu ◽  
Xiangdong Zhang
Keyword(s):  
Efficient Verification ◽  
Dicke States

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

scholarly journals PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced Databases

2021 ◽  
Author(s):  
Yin Li ◽  
Dhrubajyoti Ghosh ◽  
Peeyush Gupta ◽  
Sharad Mehrotra ◽  
Nisha Panwar ◽  
...  
Keyword(s):  
Outsourced Databases
Sign in / Sign up

Export Citation Format

Share Document