Sciweavers

163 search results - page 15 / 33
» Computationally Convincing Proofs of Knowledge
Sort
View
TAMC
2007
Springer
14 years 1 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
EUROCRYPT
1999
Springer
13 years 12 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
IEEESCC
2006
IEEE
14 years 1 months ago
Ontology Reconciliation for Service-Oriented Computing
Service-oriented computing (SOC) is viewed as the computing paradigm of the near future, allowing for the dynamic interaction of services provided by distributed business partners...
Jingshan Huang, Jiangbo Dang, Michael N. Huhns
CSR
2007
Springer
14 years 1 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich
CCS
2005
ACM
14 years 1 months ago
Applications of secure electronic voting to automated privacy-preserving troubleshooting
Recent work [27, 15] introduced a novel peer-to-peer application that leverages content sharing and aggregation among the peers to diagnose misconfigurations on a desktop PC. Thi...
Qiang Huang, David Jao, Helen J. Wang