Jayden John

dblp:395/7671 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Hardware security and side channels · 100%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels › hardware obfuscation
integrated circuit obfuscation
0.912025
TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns · DAC 2025
Hardware security and side channels
intellectual property protection
0.912025
TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns · DAC 2025
Quantum computing and quantum information
quantum circuit compilation
0.912025
TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns · DAC 2025
Compilers and program optimization › domain-specific compilation
quantum compilation
0.312025
TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns · DAC 2025

Methods — techniques the papers use, named apart from their topics

interlocking splitting · 2.6circuit obfuscation · 2.6
YearPublicationVenuePosition
2025 TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns
abstract
In quantum computing, quantum circuits are fundamental representations of quantum algorithms, which are compiled into executable functions for quantum solutions. Quantum compilers transform algorithmic quantum circuits into one compatible with target quantum computers, bridging quantum software and hardware. However, untrusted quantum compilers pose significant risks. They can lead to the theft of quantum circuit designs and compromise sensitive intellectual property (IP). In this paper, we propose TetrisLock, a split compilation method for quantum circuit obfuscation that uses an interlocking splitting pattern to effectively protect IP with minimal resource overhead. Our approach divides the quantum circuit into two interdependent segments, ensuring that reconstructing the original circuit functionality is possible only by combining both segments and eliminating redundancies. This method makes reverse engineering by an untrusted compiler unrealizable, as the original circuit is never fully shared with any single entity. Also, our approach eliminates the need for a trusted compiler to process the inserted random circuit, thereby relaxing the security requirements. Additionally, it defends against colluding attackers with mismatched numbers of qubits, while maintaining low overhead by preserving the original depth of the quantum circuit. We demonstrate our method by using established RevLib benchmarks, showing that it achieves a minimal impact on functional accuracy (less than 1%) while significantly reducing the likelihood of IP inference.
Jayden John, Ben Dong
DAC2