1064 search results - page 112 / 213 » Cryptography from Anonymity |
140
click to vote
TCC
2004
Springer
15 years 9 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
142
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
147
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
150
Voted
CTRSA
2005
Springer
15 years 9 months ago
2005
Springer
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
138
click to vote
EUROCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...