Su / Conti / Cao | Information and Communications Security | Buch | 978-981-9268-30-6 | www.sack.de

Buch, Englisch, 740 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

Su / Conti / Cao

Information and Communications Security

28th International Conference, ICICS 2026, Fukui, Japan, October 27–30, 2026, Proceedings, Part I
Erscheinungsjahr 2027
ISBN: 978-981-9268-30-6
Verlag: Springer Singapore

28th International Conference, ICICS 2026, Fukui, Japan, October 27–30, 2026, Proceedings, Part I

Buch, Englisch, 740 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

ISBN: 978-981-9268-30-6
Verlag: Springer Singapore


This set of volumes constitutes the refereed proceedings of 28th International Conference on Information and Communications Security, ICICS 2026, held in Fukui, Japan, during October 27–30, 2026.

The 148 full papers, 69 short papers and 16 poster papers presented in this book were carefully selected and reviewed from 499 submissions. The papers are organized in the following topical sections:

Part I: Full Papers — Cryptography and Secure Protocols.
Part II: Full Papers — Federated Learning, AI Model Security and Blockchain.
Part III: Full Papers — LLM Security, Software Security and Malware Analysis.
Part IV: Full Papers — Network, IoT, Hardware Security and Privacy.
Part V: Short Papers I — Cryptography, Secure Computation and Blockchain.
Part VI: Short Papers II — AI and Systems Security, and Posters.

Su / Conti / Cao Information and Communications Security jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Post-Quantum Cryptography .

.- AH-BKZ: A Lattice Reduction Algorithm with Asynchronous Hybrid Processing.

.- Scalable Method of Reachability Analysis for Quantum Cryptographic Protocols via Tensor Network Partitioning.

.- A RISC-V Software Implementation and Instruction Set Extension for PERK.

.- A Compact Ring-LWR KEM over Power-of-Two Arithmetic with Efficient NTT-Based Multiplication.

.- Efficient Constant-Time Traversal of Isogeny22Chain in SQIsign via Montgomery Arithmetic.

.- Optimized Implementation of Kyber on Resource-Constrained 8-bit AVR Microcontrollers.

.- A Holistic PS-PL-AIE Co-Design for ML-KEM and ML-DSA on Versal AI Platforms.

.- Memory-Efficient Implementation of Scloud+ for Resource-Constrained Embedded Devices.

.- Cryptanalysis .

.- Model-Space Reversal for Efficient Federated Agnostic Unlearning.

.- Improving Small Private Exponent Attack on RSA: Making It Faster and More Practical.

.- Artistic Adversarial Examples: Graffiti-Based Adversarial Attacks on Traffic Sign Recognition.

.- On the Committing Security of Generic Compositions for Authenticated Encryption.

.- Signatures and Public-Key Encryption.

.- Prefix Puncturable Signatures from Hierarchical Identity-Based Signatures.

.- Efficient Dual-Side Online/Offline Heterogeneous Signcryption for Low-Altitude SAGINs.

.- Composable Aggregation of Schnorr Signatures via Transcript Rebinding .

.- Concurrent Signatures from Isogeny Assumptions.

.- Batching Returns: Revamping Insecure Exponent-Inversion Ring Signatures.

.- TreeCast: Multi-Party Key Establishment Protocol for IoT Devices.

.- Extended Withdrawable Signatures with Refined Security: Generic Constructions and Post-Quantum Instantiations.

.- Generic Construction of CCA-Secure PKE from Key-Insulated and Privacy-Preserving Signatures with Publicly Derived Public Key.

.- AnonyWing: Anonymous Message Delivery.

.- SoK: Ring Signatures from Symmetric-Key Primitives: A Systematisation and Research Agenda.

.- DL-Based Ring Signatures Using Curve Trees: Sublinear Signing and Verification with Precomputed Tree.

.- Secure Computation and Private Set Operations .

.- Practical Private Set Union via Trusted Execution Environments.

.- Secure Constant-Round Multi-Party Fair Exchange without Broadcast Channel.

.- Graph-based Asynchrony for Any Linear Verifiable Secret Sharing Scheme.

.- Multi-party Computation over Finite Cyclic Groups with Friends and Foes.

.- Private Set Union Aggregates via Functional Encryption.

.- Prism: Scalable and Efficient High-Dimensional Fuzzy Private Set Intersection via Compact Mapping.

.- VMES-MC: A Lightweight Verifiable Multi-Owner Encrypted Search Scheme for Mobile Cloud.

.- Homomorphic Encryption .

.- PixCrypt: Fast Fine-Grained FHE with Range-Aware Caching.

.- FBAN: A Fully Homomorphic Encryption Compatible Bottleneck Attention Network for Privacy-Preserving Behavioral Authentication.

.- Functional Bootstrapping for Fully Homomorphic Encryption Over the Integers.

.- SHADE: A Symmetric-Homomorphic Adaptor for Duplex Evaluation over AES-Transciphered Circuits.

.- Zero-Knowledge and Card-Based Protocols.

.- Human-Extractable ZK Proofs of Knowledge: A Solution to Dark DAOs.

.- Card-Based Zero-Knowledge Proof Protocol for Polyomino Tiling Puzzle.



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.