CCS 2008 - PDF Preprint Papers

CCS 2008 Conference on Computer and Communications Security

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCS-2008 Paper

click to vote

CCS
2008
ACM

303views Security Privacy» more CCS 2008»

Tupni: automatic reverse engineering of input formats

13 years 6 months ago

Download research.microsoft.com

Recent work has established the importance of automatic reverse engineering of protocol or file format specifications. However, the formats reverse engineered by previous tools ha...

Weidong Cui, Marcus Peinado, Karl Chen, Helen J. W...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	303	Tupni: automatic reverse engineering of input formats	claim
2	212	SEAR: a secure efficient ad hoc on demand routing protocol for wireless networks	claim
3	209	Towards practical biometric key generation with randomized biometric templates	claim
4	186	Measuring network security using dynamic bayesian network	claim
5	184	Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps	claim
6	183	Is complexity really the enemy of software security?	claim
7	182	Building castles out of mud: practical access pattern privacy and correctness on untrusted storage	claim
8	181	Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma	claim
9	179	FairplayMP: a system for secure multi-party computation	claim
10	179	Cognitive security for personal devices	claim
11	177	Robust, anonymous RFID authentication with constant key-lookup	claim
12	173	A practical mimicry attack against powerful system-call monitors	claim
13	168	Stale-safe security properties for group-based secure information sharing	claim
14	168	Privacy oracle: a system for finding application leaks with black box differential testing	claim
15	166	Deconstructing new cache designs for thwarting software cache-based side channel attacks	claim
16	165	HMAC is a randomness extractor and applications to TLS	claim
17	165	Flexible and secure enterprise rights management based on trusted virtual domains	claim
18	164	On spatio-temporal constraints and inheritance in role-based access control	claim
19	163	Mechanisms for usage control	claim
20	161	Ether: malware analysis via hardware virtualization extensions	claim
21	160	Improving the scalability of platform attestation	claim
22	159	Towards provable secure neighbor discovery in wireless networks	claim
23	152	Certificateless signcryption	claim
24	152	Code injection attacks on harvard-architecture devices	claim
25	151	Increased DNS forgery resistance through 0x20-bit encoding: security via leet queries	claim
26	150	Efficient security primitives derived from a secure aggregation algorithm	claim
27	150	BootJacker: compromising computers using forced restarts	claim
28	149	VEP: a virtual machine for extended proof-carrying code	claim
29	149	Adaptive distributed mechanism against flooding network attacks based on machine learning	claim
30	148	Controlled privacy preserving keyword search	claim
31	146	EON: modeling and analyzing dynamic access control systems with logic programs	claim
32	144	Assessing query privileges via safe and efficient permission composition	claim
33	143	CMV: automatic verification of complete mediation for java virtual machines	claim
34	143	Principled reasoning and practical applications of alert fusion in intrusion detection systems	claim
35	143	The risk-utility tradeoff for IP address truncation	claim
36	142	Black-box accountable authority identity-based encryption	claim
37	141	Flexible security configuration for virtual machines	claim
38	140	Multi-use unidirectional proxy re-signatures	claim
39	140	User-controllable learning of security and privacy policies	claim
40	138	Unbounded verification, falsification, and characterization of security protocols by pattern refinement	claim
41	138	Efficiently tracking application interactions using lightweight virtualization	claim
42	137	Avoiding timing channels in fixed-priority schedulers	claim
43	135	Authenticated hash tables	claim
44	135	Efficient and extensible security enforcement using dynamic data flow analysis	claim
45	134	Mitigating DNS DoS attacks	claim
46	134	Computational soundness of observational equivalence	claim
47	133	Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach	claim
48	133	Dependent link padding algorithms for low latency anonymity systems	claim
49	133	Asynchronous policy evaluation and enforcement	claim
50	131	Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard	claim
51	131	Towards automatic reverse engineering of software security configurations	claim
52	129	Towards an efficient and language-agnostic compliance checker for trust negotiation systems	claim
53	129	Location privacy of distance bounding protocols	claim
54	128	Enforcing authorization policies using transactional memory introspection	claim
55	126	Efficient attributes for anonymous credentials	claim
56	125	Securing group key exchange against strong corruptions	claim
57	125	A class of probabilistic models for role engineering	claim
58	125	Revocation games in ephemeral networks	claim
59	125	Privacy-safe network trace sharing via secure queries	claim
60	124	SOMA: mutual approval for included content in web pages	claim
61	124	Automatic feature selection for anomaly detection	claim
62	120	Provably secure browser-based user-aware mutual authentication over TLS	claim
63	119	Reconsidering physical key secrecy: teleduplication via optical decoding	claim
64	118	Minimal backups of cryptographic protocol runs	claim
65	118	Cryptographically verified implementations for TLS	claim
66	118	Mutual authentication in RFID: security and privacy	claim
67	117	SNAPP: stateless network-authenticated path pinning	claim
68	116	Open problems in the security of learning	claim
69	115	A look in the mirror: attacks on package managers	claim
70	115	Spamalytics: an empirical analysis of spam marketing conversion	claim
71	115	When good instructions go bad: generalizing return-oriented programming to RISC	claim
72	114	Personalized access control for a personally controlled health record	claim
73	113	On the protocol composition logic PCL	claim
74	113	A security architecture for transient trust	claim
75	112	Online subscriptions with anonymous access	claim
76	112	Towards automated proofs for asymmetric encryption schemes in the random oracle model	claim
77	111	A general model of probabilistic packet marking for IP traceback	claim
78	111	A formal framework for reflective database access control policies	claim
79	111	Enforcing a security pattern in stakeholder goal models	claim
80	109	RFIDs and secret handshakes: defending against ghost-and-leech attacks and unauthorized reads with context-aware communications	claim
81	108	Information leaks in structured peer-to-peer anonymous communication systems	claim
82	107	PEREA: towards practical TTP-free revocation in anonymous authentication	claim
83	106	Secure neighbor discovery in wireless networks: formal investigation of possibility	claim
84	106	POSH: a generalized captcha with security applications	claim
85	106	A formal security policy for xenon	claim
86	105	Boxing clever with IOMMUs	claim
87	104	Computationally sound mechanized proofs for basic and public-key Kerberos	claim
88	104	A low-cost attack on a Microsoft captcha	claim
89	103	Type-checking zero-knowledge	claim
90	100	Identity-based encryption with efficient revocation	claim
91	99	Verified implementations of the information card federated identity-management protocol	claim
92	98	Using rhythmic nonces for puzzle-based DoS resistance	claim
93	98	Secure control of portable images in a virtual computing utility	claim
94	97	Rootkit-resistant disks	claim
95	97	Towards experimental evaluation of code obfuscation techniques	claim
96	97	Remote attestation on program execution	claim
97	96	Traitor tracing with constant size ciphertext	claim
98	92	A fast real-time memory authentication protocol	claim
99	90	Usage control platformization via trustworthy SELinux	claim
100	89	Verifiable functional purity in java	claim
101	89	OMash: enabling secure web mashups via object abstractions	claim
102	86	Private combinatorial group testing	claim
103	82	Robust content-driven reputation	claim
104	81	Trust management for secure information flows	claim
105	76	Robust defenses for cross-site request forgery	claim
106	73	Practical forward secure sequential aggregate signatures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers