3003 search results - page 402 / 601 » Software Security: Building Security In |
134
click to vote
ASIACRYPT
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
117
click to vote
ITP
2010
15 years 9 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
148
Voted
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
150
click to vote
CTRSA
2006
Springer
15 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
137
Voted
FSE
2009
Springer
15 years 8 months ago
2009
Springer
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...