Sciweavers

224 search results - page 14 / 45
» Isolated Proofs of Knowledge and Isolated Zero Knowledge
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård
EUROCRYPT
2006
Springer
13 years 11 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
IACR
2011
134views more  IACR 2011»
12 years 7 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Rule-based knowledge aggregation for large-scale protein sequence analysis of influenza A viruses
Background: The explosive growth of biological data provides opportunities for new statistical and comparative analyses of large information sets, such as alignments comprising te...
Olivo Miotto, Tin Wee Tan, Vladimir Brusic
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