Sciweavers

61 search results - page 7 / 13
» DFM: where's the proof of value
Sort
View
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 18 days ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
EUROCRYPT
1999
Springer
13 years 11 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
VMCAI
2004
Springer
14 years 21 days ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
EUROCRYPT
1999
Springer
13 years 11 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
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
14 years 1 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito