165 search results - page 12 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
115
click to vote
ECCC
2007
14 years 11 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
ICISC
2008
15 years 1 months ago
2008
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...