773 search results - page 35 / 155 » On Cryptographic Assumptions and Challenges |
FOSSACS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
101
click to vote
GC
2004
Springer
15 years 7 months ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
112
click to vote
TCC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
106
click to vote
TCC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
106
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...