default search action
Journal of Computer Security, Volume 21
Volume 21, Number 1, 2013
- Simon Meier, Cas Cremers, David A. Basin:
Efficient construction of machine-checked symbolic protocol security proofs. 41-87 - Véronique Cortier, Ben Smyth:
Attacking and fixing Helios: An analysis of ballot secrecy. 89-148 - Frédéric Cuppens, Nora Cuppens-Boulahia, Yehia Elrakaiby:
Formal specification and management of security policies with collective group obligations. 149-190
Volume 21, Number 2, 2013
- Arturo Geigel:
Neural network Trojan. 191-232 - Dhananjay S. Phatak, Alan T. Sherman, Nikhil Joshi, Bhushan Sonawane, Vivek G. Relan, Amol Dawalbhakta:
Spread Identity: A new dynamic address remapping mechanism for anonymity and DDoS defense. 233-281 - Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider:
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design. 283-315
Volume 21, Number 3, 2013
- Murtuza Jadliwala, Igor Bilogrevic, Jean-Pierre Hubaux:
Optimizing mix-zone coverage in pervasive wireless networks. 317-346 - Alfred Kobsa, Rishab Nithyanand, Gene Tsudik, Ersin Uzun:
Can Jannie verify? Usability of display-equipped RFID tags for security purposes. 347-370 - Gunnar Kreitz:
Flow stealing: A well-timed redirection attack. 371-391 - Amir Herzberg, Ronen Margulies:
Forcing Johnny to login safely. 393-424 - Sabrina De Capitani di Vimercati, Sara Foresti, Stefano Paraboschi, Gerardo Pelosi, Pierangela Samarati:
Supporting concurrency and multiple indexes in private access to outsourced data. 425-461
Volume 21, Number 4, 2013
- Piotr Mardziel, Stephen Magill, Michael Hicks, Mudhakar Srivatsa:
Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation. 463-532 - Fangfei Zhou, Manish Goel, Peter Desnoyers, Ravi Sundaram:
Scheduler vulnerabilities and coordinated attacks in cloud computing. 533-559 - John Homer, Su Zhang, Xinming Ou, David Schmidt, Yanhui Du, S. Raj Rajagopalan, Anoop Singhal:
Aggregating vulnerability metrics in enterprise networks using attack graphs. 561-597
Volume 21, Number 5, 2013
- Ivan Visconti:
Special Issue: Advances in Security for Communication Networks. 599-600 - Joshua Baron, Karim El Defrawy, Kirill Minkovich, Rafail Ostrovsky, Eric Tressler:
5PM: Secure pattern matching. 601-625 - Olivier Blazy, Georg Fuchsbauer, David Pointcheval, Damien Vergnaud:
Short blind signatures. 627-661 - Craig Gentry, Shai Halevi, Chris Peikert, Nigel P. Smart:
Field switching in BGV-style homomorphic encryption. 663-684 - Helger Lipmaa, Bingsheng Zhang:
A more efficient computationally sound non-interactive zero-knowledge shuffle argument. 685-719 - Steven A. Myers, Mona Sergi, Abhi Shelat:
Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness. 721-748 - Juan Manuel González Nieto, Mark Manulis, Bertram Poettering, Jothi Rangasamy, Douglas Stebila:
Publicly verifiable ciphertexts. 749-778
Volume 21, Number 6, 2013
- Pierpaolo Degano, Joshua D. Guttman:
Preface. 779-780 - Miriam Paiola, Bruno Blanchet:
Verification of security protocols with lists: From length one to unbounded length. 781-816 - David A. Basin, Cas Cremers, Simon Meier:
Provably repairing the ISO/IEC 9798 standard for entity authentication. 817-846 - Myrto Arapinis, Sergiu Bursuc, Mark Ryan:
Privacy-supporting cloud computing by in-browser key translation. 847-880 - Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Federico Olmedo, Santiago Zanella Béguelin:
Verified indifferentiable hashing into elliptic curves. 881-917 - Umut A. Acar, Amal Ahmed, James Cheney, Roly Perera:
A core calculus for provenance. 919-969 - Matteo Centenaro, Riccardo Focardi, Flaminia L. Luccio:
Type-based analysis of key management in PKCS#11 cryptographic devices. 971-1007
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.