Sciweavers

33 search results - page 5 / 7
» Oracles Are Subtle But Not Malicious
Sort
View
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 9 months ago
Signing a Linear Subspace: Signature Schemes for Network Coding
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
Dan Boneh, David Freeman, Jonathan Katz, Brent Wat...
IEEECIT
2010
IEEE
13 years 6 months ago
On Small Subgroup Non-confinement Attack
The small subgroup confinement attack works by confining cryptographic operations within a small subgroup, in which exhaustive search is feasible. This attack is overt and hence ca...
Feng Hao
CCS
2011
ACM
12 years 8 months ago
How to break XML encryption
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
Tibor Jager, Somorovsky Juraj
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 8 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
ICSE
2004
IEEE-ACM
14 years 8 months ago
Elaborating Security Requirements by Construction of Intentional Anti-Models
Caring for security at requirements engineering time is a message that has finally received some attention recently. However, it is not yet very clear how to achieve this systemat...
Axel van Lamsweerde