default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16. ISC 2013: Dallas, Texas, USA
- Yvo Desmedt:
Information Security, 16th International Conference, ISC 2013, Dallas, Texas, USA, November 13-15, 2013, Proceedings. Lecture Notes in Computer Science 7807, Springer 2015, ISBN 978-3-319-27658-8 - Irfan Ahmed
, Golden G. Richard III, Aleksandar Zoranic, Vassil Roussev:
Integrity Checking of Function Pointers in Kernel Pools via Virtual Machine Introspection. 3-19 - Steffen Wagner, Christoph Krauß, Claudia Eckert:
Lightweight Attestation and Secure Code Update for Multiple Separated Microkernel Tasks. 20-36 - Teng Guo, Feng Liu, Chuan Kun Wu, YoungChang Hou, YaWei Ren, Wen Wang:
The Security Defect of a Multi-pixel Encoding Method. 39-48 - Stephen R. Tate, Roopa Vishwanathan, Scott Weeks:
Encrypted Secret Sharing and Analysis by Plaintext Randomization. 49-65 - Tadanori Teruya, Jun Sakuma:
Round-Efficient Private Stable Matching from Additive Homomorphic Encryption. 69-86 - Takashi Kitagawa, Hiroki Kojima, Nuttapong Attrapadung, Hideki Imai:
Efficient and Fully Secure Forward Secure Ciphertext-Policy Attribute-Based Encryption. 87-99 - Takashi Yamakawa, Shota Yamada, Takahiro Matsuda, Goichiro Hanaoka, Noboru Kunihiro:
Reducing Public Key Sizes in Bounded CCA-Secure KEMs with Optimal Ciphertext Length. 100-109 - Marián Kühnel, Ulrike Meyer:
4GMOP: Mopping Malware Initiated SMS Traffic in Mobile Networks. 113-129 - Byungho Min, Vijay Varadharajan:
Design and Analysis of a Sophisticated Malware Attack Against Smart Grid. 130-139 - Cristina Alcaraz, Estefanía Etchevés Miciolino, Stephen D. Wolthusen:
Multi-round Attacks on Structural Controllability Properties for Non-complete Random Graphs. 140-151 - Dongxia Bai, Hongbo Yu:
Improved Meet-in-the-Middle Attacks on Round-Reduced ARIA. 155-168 - Lin Jiao, Bin Zhang, Mingsheng Wang:
Establishing Equations: The Complexity of Algebraic and Fast Algebraic Attacks Revisited. 169-184 - Routo Terada, Reynaldo Cáceres Villena:
Factoring a Multiprime Modulus N with Random Bits. 185-196 - Roberto Avanzi, Billy Bob Brumley:
Faster 128-EEA3 and 128-EIA3 Software. 199-208 - Alberto F. Martínez-Herrera, J. Carlos Mex-Perera, Juan Arturo Nolazco-Flores:
Merging the Camellia, SMS4 and AES S-Boxes in a Single S-Box with Composite Bases. 209-217 - Ding Wang, Ping Wang:
Offline Dictionary Attack on Password Authentication Schemes Using Smart Cards. 221-237 - Yanjiang Yang, Xuhua Ding, Haibing Lu, Jian Weng, Jianying Zhou:
Self-blindable Credential: Towards Anonymous Entity Authentication Upon Resource Constrained Devices. 238-247 - Ioana Boureanu, Aikaterini Mitrokotsa, Serge Vaudenay:
Practical and Provably Secure Distance-Bounding. 248-258 - Niharika Sachdeva, Nitesh Saxena, Ponnurangam Kumaraguru:
On the Viability of CAPTCHAs for use in Telephony Systems: A Usability Field Study. 261-279 - Vaibhav Garg, L. Jean Camp:
Cars, Condoms, and Facebook. 280-289 - Yanjiang Yang, Xuhua Ding, Haibing Lu, Zhiguo Wan, Jianying Zhou:
Achieving Revocable Fine-Grained Cryptographic Access Control over Cloud Data. 293-308 - Xing Jin, Lusha Wang, Tongbo Luo, Wenliang Du:
Fine-Grained Access Control for HTML5-Based Mobile Applications in Android. 309-318 - Christoph Kerschbaumer, Eric Hennigan, Per Larsen, Stefan Brunthaler, Michael Franz:
CrowdFlow: Efficient Information Flow Security. 321-337 - Sarker T. Ahmed Rumee, Donggang Liu:
DroidTest: Testing Android Applications for Leakage of Private Information. 341-353 - Ping Chen, Nick Nikiforakis, Christophe Huygens, Lieven Desmet:
A Dangerous Mix: Large-Scale Analysis of Mixed-Content Websites. 354-363 - Naoto Yanai, Masahiro Mambo, Eiji Okamoto:
An Ordered Multisignature Scheme Under the CDH Assumption Without Random Oracles. 367-377 - Mohsen Alimomeni, Reihaneh Safavi-Naini:
Human Assisted Randomness Generation Using Video Games. 378-390 - Antoine Joux, Antoine Rojat:
Security Ranking Among Assumptions Within the Uber Assumption Framework. 391-406 - Matheus F. de Oliveira, Marco Aurélio Amaral Henriques:
A Secure and Efficient Method for Scalar Multiplication on Supersingular Elliptic Curves over Binary Fields. 407-416
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-29 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
