Sciweavers

1446 search results - page 22 / 290
» Local zero knowledge
Sort
View
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
14 years 7 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
Eleanor Birrell, Salil P. Vadhan
TCC
2010
Springer
117views Cryptology» more  TCC 2010»
14 years 7 months ago
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
Rafail Ostrovsky, Omkant Pandey, Ivan Visconti
114
Voted
ESWS
2011
Springer
14 years 1 months ago
Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution
Abstract. Link traversal based query execution is a new query execution paradigm for the Web of Data. This approach allows the execution engine to discover potentially relevant dat...
Olaf Hartig
IACR
2011
152views more  IACR 2011»
13 years 9 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
CIKM
2008
Springer
14 years 11 months ago
Pairwise statistical significance of local sequence alignment using multiple parameter sets
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...
Ankit Agrawal, Xiaoqiu Huang