Sciweavers

Share
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
7 years 10 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
IACR
2011
147views more  IACR 2011»
8 years 2 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
IACR
2011
134views more  IACR 2011»
8 years 2 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
ASIACRYPT
2011
Springer
8 years 2 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
JCP
2008
206views more  JCP 2008»
9 years 2 months ago
SW-R2P: A Trusted Small World Overlay P2P Network with Zero Knowledge Identification
In order to implement both the efficiency and security in the Peer-to-Peer (P2P) network, we design a trusted small world overlay P2P network with the role based and reputation bas...
Yingjie Xia, Guanghua Song, Yao Zheng
EUROCRYPT
2008
Springer
9 years 4 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
EUROCRYPT
2007
Springer
9 years 6 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
9 years 7 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
9 years 8 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
TARK
2009
Springer
9 years 9 months ago
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
books