Seminars
Monash Cybersecurity Seminars
Be the first to know about cybersecurity innovations. Gain rare insights from world-leading experts. Free to attend, the Monash Cybersecurity Seminars are your portal to the latest and greatest in the discipline – from quantum-safe cryptography to blockchain.
If you would like to get involved in more Faculty of IT events,
discover what's on now.
Missed out? Catch up on our seminars online now.
Framing and Realistic Secret Sharing
The use of Game Theory to Secret Sharing has lead to Rational Secret Sharing (RSS). It claims that from an...
Quantum Commitments and Signatures without One-Way Functions
In the classical world, the existence of commitments is equivalent to the existence of one-way functions. In the quantum setting,...
Creating Deceptive Machines
This talk is a summary of the speaker's PhD thesis entitled "Deception". It is the first full computational treatment in...
Serverless Computing across Edge-to-Cloud Continuum
During the past decade, human beings experienced the prevalence of communication through various digital devices. While we can call the...
When Artificial Intelligence Meets the Internet of Things: Motivations, Challenges, and Applications
Artificial Intelligence of Things (AIoT) is a newly emerging technology that combines IoT and AI technologies to enable decision making...
Using Key Encapsulation Mechanisms for Authentication
In 2020, we proposed KEMTLS, an alternative for the TLS 1.3 handshake that uses implicit authentication via key encapsulation mechanisms,...
A Deep Dive into the Socio-Technical Aspects of Delays in Security Patching
Download presentation (PDF, 5.07 MB)Most of the successful security attacks can be attributed to delays in security patching. Whilst significant attention has...
Threshold Signatures with Private Accountability
In this work, we present a new type of threshold signature scheme that provides both privacy and accountability for signers....
Understanding the Science of Deception and Disinformation
As the bandwidth of digital media has grown exponentially over the last two decades, deception and its use in disinformation...
Post-Quantum Signature from Isomorphism Problems of Trilinear Forms
In this talk, the speaker will present a new proposal on post-quantum signature from alternating trilinear form equivalence problem. The...
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
We present a much-improved practical protocol, based on the hardness of Module-SIS and Module-LWE problems, for proving knowledge of a...
ROAST: Robust Asynchronous Schnorr Threshold Signatures
Bitcoin and other cryptocurrencies have recently introduced support for Schnorr signatures whose cleaner algebraic structure, as compared to ECDSA, allows...
Enabling Deep Learning in a Resource-Limited Environment with Data Privacy and Software Security
In today’s data-driven world, deep learning (DL) has been widely used in various applications, including precision health/medicine, computer vision, and...
Dumbo Protocol Family: Making Asynchronous Consensus Real
Asynchronous consensus is the most robust consensus protocol, thus critical for blockchains deployed over the open Internet. Unfortunately, all previous...
Cybersecurity in the Age of AI: From Social Networking to Internet of Things
Artificial Intelligence might contain a treasure trove of publicly-available data which can lead to deep intrusions into our lives. In...
Blockchain Security by Incentives
The security of blockchain protocols critically relies on incentive compatibility. This talk will review the basic principles of game-theoretical analysis...
Analysis of the Ideal-SIVP to Ring-DLWE Security Reduction
This talk, which will describe several deficiencies from a practice-oriented viewpoint in the approximate ideal-SIVP to ring-DLWE reduction, is based...
Information Dispersal with Provable Retrievability for Rollups
The ability to verifiably retrieve transaction or state data stored off-chain is crucial to blockchain scaling techniques such as rollups...
BAT: Small and Fast KEM over NTRU Lattices
In this talk, the speaker will introduce a new lattice KEM, called BAT. BAT has the smallest communication size, i.e....
Zero-Knowledge Proofs of Isogeny
The talk will give an overview of zero-knowledge proofs, isogeny cryptography, and the problem of proving an isogeny. The speaker...
Moving Target Defence (MTD): Recent Advances and Challenges
This talk will cover the following topics: 1) Introduction to Moving Target Defences (MTD) including brief intro to security fundamentals,...
Beating Classical Impossibility of Position Verification
In this work, we initiate the study of position verification protocols with classical verifiers. Position verification is the central task...
Speeding Dumbo: Making Asynchronous (Permissioned) Consensus Even Faster
Asynchronous BFT consensus protocols can enable a set of honest parties to reach agreement on an ever-growing linearized log of...
New Applications of Zero-Knowledge Proofs
Zero-knowledge proofs have recently seen significant deployment and interest in the blockchain space. However, many of the tools motivated by...
Structured Encryption and Dynamic Leakage Suppression
Structured encryption (STE) schemes encrypt data structures in such a way that they can be privately queried. Special cases of...
Right To Ask
The Right To Ask project will use cryptographic techniques from end-to-end verifiable e-voting for a much simpler problem: voting on...
Efficient and Affordable Zero-Knowledge Proofs: ResNet Inference and RAM Computation
Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of attention because such protocols can easily prove...
Making Secure Blockchains Scale
As blockchain has found applications to track ownership of digital assets, it is crucial for companies to adopt more secure...
Post-Quantum Designated-Verifier zkSNARKs from Lattices
Zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs) enable efficient privacy-preserving proofs of membership for general NP languages. These are important...
Zero-Knowledge Proofs for Large Circuits
While succinct zero-knowledge protocols have long been in the spotlight of researchers due to Blockchain applications, this talk will give...
Provable Security for Deterministic Wallets
Deterministic Wallets are an important tool for storing keys in cryptocurrencies such as Bitcoin or Ethereum. This talk will give...
Does Fiat-Shamir Require a Cryptographic Hash Function?
The Fiat-Shamir transform is a general method for reducing interaction in public-coin protocols by replacing the random verifier messages with...
MPC meets ML: Privacy-Preserving Machine Learning
This talk is on privacy-preserving machine learning using Multi-Party Computation (MPC) techniques. The primary work that the talk will rely...
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices
In this talk, the speaker will talk about sets of ring elements such that the differences between the members are...
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs
Many of the recent advanced lattice-based Sigma-/public-coin honest verifier (HVZK) interactive protocols based on the techniques developed by Lyubashevsky (Asiacrypt'09,...
Privacy-Preserving Machine Learning
Machine learning is now used extensively in many application domains such as pattern recognition, medical diagnosis and credit-risk assessment. Applications...
Zero Knowledge Proofs and Their Applications to Machine Learning
Machine learning has become increasingly prominent and is widely used in various applications in practice. Despite its great success, the...
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments
This talk is about a new approach of constructing range proofs. It is modular, and leads to highly competitive range...
Many-out-of-Many Proofs and Applications to Anonymous Zether
This talk describes a new zero-knowledge proof protocol called "many-out-of-many proofs", which generalizes the classic "one-out-of-many proofs" of Groth and...
LEAP: Leakage-Abuse Attack on Efficiently Deployable, Efficiently Searchable Encryption with Partially Known Dataset
Searchable Encryption (SE) enables private queries on encrypted documents. Most existing SE schemes focus on constructing industrial-ready, practical solutions at...
FPPW: A Fair and Privacy Preserving Watchtower For Bitcoin
Most payment channels work based on this idea that once a dishonest channel party records an old state on-chain, its...
Code-based Cryptography with Restricted Errors
The general Syndrome Decoding Problem (SDP) is the main foundation of code-based cryptography. We introduce a variant of the SDP,...
TARDIS: A Foundation of Time-Lock Puzzles in UC
Time-based primitives like time-lock puzzles (TLP) are finding widespread use in practical protocols, partially due to the surge of interest...
Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy
In Dynamic Symmetric Searchable Encryption (DSSE), forward privacy ensures that previous search queries cannot be associated with future updates, while...
Optimal Broadcast Encryption from Pairings and LWE
Boneh, Waters and Zhandry (CRYPTO 2014) used multilinear maps to provide a solution to the long-standing problem of public-key broadcast...
MuSig2: Simple Two-Round Schnorr Multi-Signatures
Multi-signatures enable a group of signers to produce a single signature on a given message. Recently, Drijvers et al. (S&P'19)...
Forward and Backward Private Conjunctive Searchable Symmetric Encryption
Dynamic searchable symmetric encryption (SSE) supports updates and keyword searches in tandem on outsourced symmetrically encrypted data, while aiming to...
OblivSketch: Oblivious Network Measurement as a Cloud Service
Network function virtualisation enables versatile network functions as cloud services with reduced cost. Specifically, network measurement tasks such as heavy-hitter...
KVaC: Key-Value Commitments for Blockchains and Beyond
As blockchains grow in size, validating new transactions becomes more and more resource intensive. To deal with this, there is...
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Zero-Knowledge Proofs for Set Membership are primitives that allow one to prove that is a member of a set without...
Obfuscation from Circular Security
We describe a new approach to indistinguishability obfuscation, which yields candidate schemes that are secure under assumptions having a "circular...
Verifiable Timed Signatures Made Practical
A verifiable timed signature (VTS) scheme allows one to time-lock a signature on a known message for a given amount...
Private Computing on Public Blockchains
Public blockchains have emerged over the last decade as a promising architecture for distributed computing, touted by some as "the...
Legion: Best-First Concolic Execution
Concolic execution and fuzzing are two complementary coverage-based testing techniques. How to achieve the best of both remains an open...
The evolution of Ouroboros: A proof-of-stake implementation of Nakamoto’s vision
The release and wide adoption of Bitcoin has demonstrated how Byzantine consensus can be performed on a global scale. However,...
Virtual ASICs: Generalized PoS-Mining
In proof-of-work based cryptocurrencies, miners invest computing power to maintain a distributed ledger. The drawback of such a consensus protocol...
Lattice-Based Distributed Signature
Most recent works on distributed signatures have focused on ECDSA and over variants of Schnorr signatures. However, little attention has...
Encrypted Blockchain Databases
Blockchain databases are storage systems that combine properties of blockchains and databases like decentralization, tamper-proofness, low query latency and support...
Verifiable Delay Functions
A verifiable delay function (VDF) is a function whose evaluation requires running a given number of sequential steps, yet the...
MMSAT: Lattice-Based Aggregate Signatures
Post-Quantum (PQ) signature schemes are known for large key and signature sizes, which may inhibit their deployment in real world...
Randomness Beacons
Randomness beacons are decentralized protocols that provide a sequence of random outputs in such a way that it is possible...
DEEP FRI Protocol
Interactive Oracle Proofs of Proximity (IOPP) is shown to be a suitable model for efficient and scalable zero-knowledge argument systems....