• Neu
Ma / Nepal | Information Security and Privacy | E-Book | www.sack.de
E-Book

E-Book, Englisch, 528 Seiten

Reihe: Computer Science

Ma / Nepal Information Security and Privacy

31st Australasian Conference, ACISP 2026, Perth, WA, Australia, July 6–9, 2026, Proceedings, Part II
Erscheinungsjahr 2026
ISBN: 978-981-9230-15-0
Verlag: Springer Singapore
Format: PDF
Kopierschutz: 1 - PDF Watermark

31st Australasian Conference, ACISP 2026, Perth, WA, Australia, July 6–9, 2026, Proceedings, Part II

E-Book, Englisch, 528 Seiten

Reihe: Computer Science

ISBN: 978-981-9230-15-0
Verlag: Springer Singapore
Format: PDF
Kopierschutz: 1 - PDF Watermark



This LNCS-volume set in constitutes the refereed proceedings of the 31st Australasian Conference on Information Security and Privacy, ACISP 2026, held in Perth, WA, Australia, during July 6–9, 2026.

The 69 full papers presented in this volume were carefully reviewed and selected from 260 submissions. The papers are organized in the following topical sections:

Part I: Applied Cryptography and Cryptanalysis; AI, Machine Learning, and Trustworthy AI Security; Network, System, and Software Security; Blockchain, Smart Contracts, and Decentralized Security; Privacy, Authentication, and Cyber-Physical Systems Security.

Part II: Applied Cryptography, Encryption, and Cryptanalysis; AI, Machine Learning, and Trustworthy AI Security; Privacy, Trust, and Secure Systems.

Part III: Applied Cryptography and Post-Quantum Security; AI, Machine Learning, and Adversarial Security; Privacy, and Secure Distributed Systems; System Security, Privacy, and Secure Computing.

Ma / Nepal Information Security and Privacy jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


.- Applied Cryptography, Encryption, and Cryptanalysis. .- Multi-Authority Attribute-Based Anonymous Credentials with Public Traceability and Revocation. .- Efficient Identity-Based Matchmaking Encryption with Enhanced Privacy and Chosen-Ciphertext Security. .- Laurent Polynomial-Based Linear Transformations for Improved Functional Bootstrapping. .- Attribute-Based Encryption for Circuits and Inner-Product Predicate Encryption from Middle-Product LWE. .- Evaluating SAT Accelerations for Cryptanalytic Trail Search - Low-Parallelism Portfolio Parallelism and A Comparison of Matsui-Based Methods. .- Related-key Secure Blockwise Universal Permutations and Non-linear SPNs. .- Beyond the U-Method: Automating the Search for UID-Based Contradictions with Constraint Programming. .- Threshold FHE with Short Decryption Shares without a Semi-trusted Server. .- Password Protected Universal Thresholdizer. .- Batch-Puncturing Circuit CP-ABE (and More) from Lattices. .- Forward-Secure Tag-Inverse Puncturable Identity-Based Encryption. .- AI, Machine Learning, and Trustworthy AI Security. .- TIDE: Making Task-Agnostic Backdoors Harder to Erase in Pre-trained Language Models. .- Backdoor Risks in Personalized Federated Learning under Practical Constraints. .- CSC: Turning the Adversary’s Poison against Itself. .- Knowledge Graph–Augmented Reasoning for Robust Multi-Modal Document Attack Detection. .- Pixel-Depth Prototypical Knowledge Consolidation Network for Deepfake Detection. .- PhishCascade: Confidence-Gated Multi-Agent Phishing Detection. .- ST-Attention-XAI: Intrinsic Spatio-Temporal Explainability for IoT Intrusion Detection via Attention Analysis. .- Harnessing Large Language Models for Real-Time Cyber Threat Detection and Response: A Comprehensive Survey. .- OblivSage: Oblivious Graph Sampling for Privacy-Preserving GNN. .- Privacy, Trust, and Secure Systems. .- Ensuring Incentive Compatibility in an Enhanced All-Pay Auction Model for User Recruitment. .- A Taxonomy-Driven Case Study of Australian Web Resources Against Technology-Facilitated Abuse. .- Understanding the Security of Cloud Storage Services: A Case Study and UC-Secure Design.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.