Sciweavers

25 search results - page 4 / 5
» How to break XML encryption
Sort
View
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
15 years 3 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
ACSAC
2010
IEEE
14 years 7 months ago
Forenscope: a framework for live forensics
Current post-mortem cyber-forensic techniques may cause significant disruption to the evidence gathering process by breaking active network connections and unmounting encrypted di...
Ellick Chan, Shivaram Venkataraman, Francis M. Dav...
IACR
2011
161views more  IACR 2011»
13 years 9 months ago
Roots of Square: Cryptanalysis of Double-Layer Square and Square+
Abstract. Square is a multivariate quadratic encryption scheme proposed in 2009. It is a specialization of Hidden Field Equations by using only odd characteristic elds and also X2...
Enrico Thomae, Christopher Wolf
CCS
2006
ACM
15 years 1 months ago
Data collection with self-enforcing privacy
Consider a pollster who wishes to collect private, sensitive data from a number of distrustful individuals. How might the pollster convince the respondents that it is trustworthy?...
Philippe Golle, Frank McSherry, Ilya Mironov
CCS
2010
ACM
14 years 10 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...