Computer Security – ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part IIIoannis Askoxylakis, Sotiris Ioannidis, Sokratis Katsikas, Catherine Meadows Springer, 2016-09-14 - 609 psl. The two-volume set, LNCS 9878 and 9879 constitutes the refereed proceedings of the 21st European Symposium on Research in Computer Security, ESORICS 2016, held in Heraklion, Greece, in September 2016. The 60 revised full papers presented were carefully reviewed and selected from 285 submissions. The papers cover a wide range of topics in security and privacy, including data protection: systems security, network security, access control, authentication, and security in such emerging areas as cloud computing, cyber-physical systems, and the Internet of Things. |
Turinys
3 | |
20 | |
On Manufacturing Resilient Opaque Constructs Against Static Analysis | 39 |
Secure Multiparty Computation | 59 |
Robust PasswordProtected Secret Sharing | 61 |
Compiling Low Depth Circuits for Practical Secure Computation | 80 |
Secure Computation of MIPS Machine Code | 99 |
Secure Logging | 118 |
Secure Code Updates for Mesh Networked Commodity LowEnd Embedded Devices | 320 |
Authenticated Key Agreement Mediated by a Proxy Reencryptor for the Internet of Things | 339 |
Data Privacy | 359 |
Information Control by PolicyBased Relational Weakening Templates | 360 |
Quantifying Location Privacy Leakage from Transaction Prices | 382 |
A Formal Treatment of Privacy in Video Data | 406 |
Security of CyberPhysical Systems | 425 |
On Attacker Models and Profiles for CyberPhysical Systems | 427 |
Improved PrivacyPreserving Transparency Logging | 121 |
Secure Logging Schemes and Certificate Transparency | 140 |
Economics of Security | 159 |
Banishing Misaligned Incentives for Validating Reports in BugBounty Platforms | 160 |
Efficient Numerical Frameworks for Multiobjective Cyber Security Planning | 179 |
Evoting and Ecommerce | 198 |
On Bitcoin Security in the Presence of Broken Cryptographic Primitives | 199 |
A Verifiable EVoting Scheme Without Tallying Authorities | 223 |
When Are Three Voters Enough for Privacy Properties? | 241 |
Efficient ZeroKnowledge Contingent Payments in Cryptocurrencies Without Scripts | 261 |
Security of the Internet of Things | 281 |
A Lightweight Authentication Protocol for CAN | 283 |
Privacy Discovery and Authentication for the Internet of Things | 301 |
Bounding the Number of Timed Intruders | 450 |
Safeguarding Structural Controllability in CyberPhysical Control Systems | 471 |
Attacks | 490 |
The Beauty or The Beast? Attacking Rate Limits of the Xen Hypervisor | 493 |
Autocomplete Injection Attack | 512 |
A Practical Forgery Attack Against Android KeyStore | 531 |
AttributeBased Cryptography | 549 |
How to Catch People Selling Decryption Devices on eBay Efficiently | 550 |
ServerAided Revocable AttributeBased Encryption | 570 |
OnlineOffline PublicIndex Predicate Encryption for FineGrained Mobile Access Control | 588 |
606 | |
Kiti leidimai - Peržiūrėti viską
Pagrindiniai terminai ir frazės
3SAT adversary algorithm analysis anonymization assumption attacker model authentication autocomplete autocomplete suggestions ballots Bitcoin certificate ciphertext ciphertext attribute circuit code update collision computation construction CP-ABE cryptographic data structure data users dataset decryption defined denial-of-service attack denote devices DRE-ip ECDSA efficient encryption scheme evaluation execution hackers hash function hash table Heidelberg history-independent identifier identity-based encryption IEEE implementation IND-CPA input intruder KeyStore knowledge linear probing LNCS malicious Merkle tree multiple nodes optimization oracle outputs parties performance phase phishing pre-image private key proof properties proposed protocol proxy re-encryption public key public parameter purchase events query random require revocation runtime scenario secret key secret sharing Sect server session key Springer SR-ABE stored tally tion transaction USENIX valid variables verify voters votes vulnerability zero-knowledge proofs