Sciweavers

719 search results - page 104 / 144
» Proving Security Protocols Correct
Sort
View
ASIACRYPT
1999
Springer
15 years 2 months ago
ECC: Do We Need to Count?
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Jean-Sébastien Coron, Helena Handschuh, Dav...
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
14 years 10 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
IH
1998
Springer
15 years 1 months ago
Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
Dogan Kesdogan, Jan Egner, Roland Büschkes
CORR
2004
Springer
120views Education» more  CORR 2004»
14 years 9 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
OOPSLA
2005
Springer
15 years 3 months ago
Finding application errors and security flaws using PQL: a program query language
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
Michael C. Martin, V. Benjamin Livshits, Monica S....