arXiv subjects

Thomas Zacharias

Publications and source records attributed to Thomas Zacharias.

17 recordsLinked to original sources

arXiv2026

Frequency resolved optical gating using parametric amplification for characterizing ultrafast temporally multimode squeezed states

Temporally multimode squeezed states have been a topic of recent interest due to their applications in quantum communication, information processing, and sensing. Characterizing the mode shapes is crucial for effectively manipulating these states, but current mode shape and state characterization techniques necessitate constraining assumptions and complicated experimental setups. Here, we propose a characterization technique that simultaneously recovers the complex temporal mode shapes and quadrature variances of ultrafast multimode squeezed states based on frequency resolved optical gating (FROG) using an optical parametric amplifier (OPA). FROG is a promising tool for quantum state characterization due to its flexibility of implementation and high temporal resolution. Using an OPA as the nonlinear process in FROG has the benefit of amplifying weak quantum states to a detectable level while preserving quantum information. Numerical simulations demonstrate the recovery of the mode shapes and levels of squeezing and anti-squeezing of ultrafast multimode squeezed states. This scheme offers a practical experimental approach to measuring arbitrary temporal mode shapes and characterizing large-scale multimode ultrafast Gaussian quantum states.

quant-ph↗

arXiv2026

Quantum Frequency Resolved Optical Gating of Few-Cycle Squeezed Vacuum

Offering terahertz of bandwidths and femtosecond timescales, ultrafast optics is enabling both the study of fundamental quantum optical phenomena and the advancement of quantum-enhanced applications. However, unlocking the full potential of ultrafast quantum optics requires accessing the temporal characteristics of ultrashort quantum pulses across ultrabroad bandwidths. This is particularly important in the near-infrared and visible range of the optical spectrum, which, unlike the terahertz and long-wave infrared, has remained beyond the reach of current techniques. Here, we break this barrier by translating frequency-resolved optical gating (FROG), a widely used technique for ultrafast classical pulse characterization, to the quantum regime. We show how such a quantum FROG can measure complex temporal modes and sub-optical-cycle quadrature covariances in the near-infrared, enabling complete characterization of microscopic Gaussian states. We experimentally use the quantum-FROG to report the measurement of quadrature correlations, complex temporal modes, and squeezing levels of multimode ultrafast squeezed vacuum states generated on a nanophotonic chip. We access multimode squeezing levels of a femtosecond quantum pulse approaching 7 dB and demonstrate FROG-based measurement bandwidths exceeding 100 THz. Quantum FROG enables measurement of previously inaccessible quantum features of ultrashort pulses at the sub-optical-cycle regime and highlights a practical path to accessing terahertz of bandwidths in quantum optics for applications in computing, sensing, and imaging.

physics.optics↗

arXiv2026

On the Necessity of Pre-agreed Secrets for Thwarting Last-minute Coercion: Vulnerabilities and Lessons From the Loki E-voting Protocol

Coercion-resistance (CR) is a crucial security property in e-voting systems. It ensures that an attacker cannot compel a voter to vote in a specific way by using threats or rewards. The Loki e-voting protocol, proposed by Giustolisi \emph{et al.} at IEEE S\&P (2024), introduces a novel design that mitigates last-minute coercion through a re-voting mechanism. It also aims to address the usability issues of the seminal JCJ e-voting protocol, specifically: i) the requirement that voters can store and hide pre-agreed credentials, and ii) the ability of voters to convincingly lie while being coerced. In this work, we identify two vulnerabilities in Loki. The first is a brute-force attack that compromises the integrity of the evasion strategy. Specifically, this attack allows an adversary to cast a ballot on behalf of their victim in a way that the evasion strategy cannot defend against, rendering it ineffective. The second vulnerability is a forced abstention attack, which allows an adversary to detect when their victim has complied with their instruction not to vote. We generalise the integrity attack to reveal a fundamental dilemma: without pre-agreed secret credentials, it is not possible to prevent last-minute coercion. Finally, we show how reverting to pre-agreed secret credentials fixes the aforementioned vulnerabilities and discuss the trade-off between tallying efficiency and stronger trust assumptions.

cs.CR↗

arXiv2025

Topological Soliton Frequency Comb in Nanophotonic Lithium Niobate

Frequency combs have revolutionized metrology, ranging, and optical clocks, which have motivated substantial efforts on the development of chip-scale comb sources. The on-chip comb sources are currently based on electro-optic modulation, mode-locked lasers, quantum cascade lasers, or soliton formation via Kerr nonlinearity. However, the widespread deployment of on-chip comb sources has remained elusive as they still require RF sources, high-Q resonators, or complex stabilization schemes while facing efficiency challenges. Here, we demonstrate an on-chip source of frequency comb based on the integration of a lithium niobate nanophotonic circuit with a semiconductor laser that can alleviate these challenges. For the first time, we show the formation of temporal topological solitons in a on-chip nanophotonic parametric oscillator with quadratic nonlinearity and low finesse. These solitons, independent of the dispersion regime, consist of phase defects separating two $\pi$-out-of-phase continuous wave solutions at the signal frequency, which is at half the input pump frequency. We use on-chip cross-correlation for temporal measurements and confirm formation of topological solitons as short as 60 fs around 2 $\mu$m, in agreement with a generalized parametrically forced Ginzburg-Landau theory. Moreover, we demonstrate a proof-of-concept turn-key operation of a hybrid-integrated source of topological frequency comb. Topological solitons offer a new paradigm for integrated comb sources, which are dispersion-sign agnostic and do not require high-Q resonators or high-speed modulators and can provide access to hard-to-access spectral regions, including mid-infrared.

physics.optics↗

arXiv2025

Quadratic Supercontinuum Generation from UV to Mid-IR in Lithium Niobate Nanophotonics

Supercontinuum light sources are widely used for applications ranging from imaging to sensing and frequency comb stabilization. The most common mechanisms for their generation rely on cubic nonlinearities, for instance in crystals, optical fibers, and integrated photonics. However, quadratic supercontinuum generation (QSCG) offers potential for enhanced energy efficiency and broader spectral coverage because of the typically much stronger nonlinearity and ability to achieve both coherent up- and down-conversion via three-wave mixing processes. Despite such potentials, demonstrations of QSCG in integrated photonic waveguides have been sparse and have barely surpassed their cubic counterparts in terms of spectral coverage and energy-efficiency. Here, we introduce a new dispersion engineering principle and experimentally demonstrate purely quadratic supercontinuum generation in lithium niobate nano-waveguides substantially outperforming previous demonstrations in integrated photonics. In one device, by engineering a near-zero dispersion profile and using a single poling period for quasi-phase matched saturated second-harmonic generation, we achieve robust and energy efficient multi-octave QSCG with only femtojoules of pump pulse energy. In another device, we use a flat dispersion profile with two distant zero crossings of group velocity dispersion (GVD) to achieve broadband difference-frequency generation (DFG) for extending the spectral coverage further into the mid-IR and cover the entire transparency window of lithium niobate from 350 nm to 5000 nm. Our results showcase how DFG-assisted QSCG can access hard-to-access spectral regions in an energy-efficient fashion by properly utilizing dispersion engineering and quasi-phase matching.

physics.optics↗

arXiv2025

Two-optical-cycle pulses from nanophotonic two-color soliton compression

Few- and single-cycle optical pulses and their associated ultra-broadband spectra have been crucial in the progress of ultrafast science and technology. Moreover, multi-color waveforms composed of independently manipulable ultrashort pulses in distinct spectral bands offer unique advantages in pulse synthesis and attosecond science. However, the generation and control of ultrashort pulses has required bulky and expensive optical systems at the tabletop scale and has so far been beyond the reach of integrated photonics. Here, we break these limitations and demonstrate two-optical-cycle pulse compression using quadratic two-color soliton dynamics in lithium niobate nanophotonics. By leveraging dispersion engineering and operation near phase matching, we achieve extreme compression, energy-efficient operation, and strong conversion of pump to the second harmonic. We experimentally demonstrate generation of $\sim$13-fs pulses at 2 $\mu$m using only $\sim$3 pJ of input energy. We further illustrate how the demonstrated scheme can be readily extended to on-chip single-cycle pulse synthesis with sub-cycle control. Our results provide a path towards realization of single-cycle ultrafast systems in nanophotonic circuits.

physics.optics↗

arXiv2025

Energy-Efficient Ultrashort-Pulse Characterization using Nanophotonic Parametric Amplification

The growth of ultrafast nanophotonic circuits necessitates the development of energy-efficient on-chip pulse characterization techniques. Nanophotonic realizations of Frequency Resolved Optical Gating, a common pulse characterization technique in bulk optics, have been challenging due to their non-collinear nature and the lack of efficient nonlinear optical processes in the integrated platform. Here, we experimentally demonstrate a novel FROG-based technique compatible with the nanophotonic platform that leverages the high gain-bandwidth of a dispersion-engineered degenerate optical parametric amplifier for energy-efficient ultrashort pulse characterization. We demonstrate on-chip pulse characterization of sub-80-fs, ~1-fJ pulses using just ~60-fJ of gate pulse energy, which is several orders of magnitude lower than the gate pulse energy required for characterizing similar pulses in the bulk counterpart. In the future, we anticipate our work will enable the characterization of ultraweak-ultrashort pulses with energies at the single photon level.

physics.optics↗

arXiv2024

Blockchain Bribing Attacks and the Efficacy of Counterincentives

We analyze bribing attacks in Proof-of-Stake distributed ledgers from a game theoretic perspective. In bribing attacks, an adversary offers participants a reward in exchange for instructing them how to behave, with the goal of attacking the protocol's properties. Specifically, our work focuses on adversaries that target blockchain safety. We consider two types of bribing, depending on how the bribes are awarded: i) guided bribing, where the bribe is given as long as the bribed party behaves as instructed; ii) effective bribing, where bribes are conditional on the attack's success, w.r.t. well-defined metrics. We analyze each type of attack in a game theoretic setting and identify relevant equilibria. In guided bribing, we show that the protocol is not an equilibrium and then describe good equilibria, where the attack is unsuccessful, and a negative one, where all parties are bribed such that the attack succeeds. In effective bribing, we show that both the protocol and the "all bribed" setting are equilibria. Using the identified equilibria, we then compute bounds on the Prices of Stability and Anarchy. Our results indicate that additional mitigations are needed for guided bribing, so our analysis concludes with incentive-based mitigation techniques, namely slashing and dilution. Here, we present two positive results, that both render the protocol an equilibrium and achieve maximal welfare for all parties, and a negative result, wherein an attack becomes more plausible if it severely affects the ledger's token's market price.

cs.GT↗

arXiv2023

On the (De)centralization of FruitChains

One of the most important features of blockchain protocols is decentralization, as their main contribution is that they formulate a distributed ledger that will be maintained and extended without the need of a trusted party. Bitcoin has been criticized for its tendency to centralization, as very few pools control the majority of the hashing power. Pass et al. proposed FruitChain [PODC 17] and claimed that this blockchain protocol mitigates the formation of pools by reducing the variance of the rewards in the same way as mining pools, but in a fully decentralized fashion. Many follow up papers consider that the problem of centralization in Proof-of-Work (PoW) blockchain systems can be solved via lower rewards' variance, and that in FruitChain the formation of pools is unnecessary. Contrary to the common perception, in this work, we prove that lower variance of the rewards does not eliminate the tendency of the PoW blockchain protocols to centralization; miners have also other incentives to create large pools, and specifically to share the cost of creating the instance they need to solve the PoW puzzle. We abstract the procedures of FruitChain as oracles and assign to each of them a cost. Then, we provide a formal definition of a pool in a blockchain system, and by utilizing the notion of equilibrium with virtual payoffs (EVP) [AFT 21], we prove that there is a completely centralized EVP, where all the parties form a single pool controlled by one party called the pool leader. The pool leader is responsible for creating the instance used for the PoW procedure. To the best of our knowledge, this is the first work that examines the construction of mining pools in the FruitChain system.

cs.CR↗

arXiv2023

Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications

Simultaneous broadcast (SBC) protocols [Chor et al., FOCS 1985] constitute a special class of broadcast channels which have proved extremely useful in the design of various distributed computing constructions (e.g., multiparty computation, coin flipping, e-voting, fair bidding). As with any communication channel, it is crucial that SBC security is composable, i.e., it is preserved under concurrent protocol executions. The work of [Hevia, SCN 2006] proposes a formal treatment of SBC in the Universal Composability (UC) framework [Canetti, FOCS 2001] and a construction secure assuming an honest majority. In this work, we provide a comprehensive revision of SBC in the UC setting and improve the results of [Hevia, SCN 2006]. In particular, we present a new SBC functionality that captures both simultaneity and liveness by considering a broadcast period such that (i) within this period all messages are broadcast independently and (ii) after the period ends, the session is terminated without requiring participation of all parties. Next, we employ time-lock encryption (TLE) over a standard broadcast channel to devise an SBC protocol that realizes our functionality against any adaptive adversary corrupting up to all-but-one parties. In our study, we capture synchronicity via a global clock [Katz et al., TCC 2013], thus lifting the restrictions of the original synchronous communication setting used in [Hevia, SCN 2006]. As a building block of independent interest, we prove the first TLE protocol that is adaptively secure in the UC setting, strengthening the main result of [Arapinis et al., ASIACRYPT 2021]. Finally, we formally exhibit the power of our SBC construction in the design of UC-secure applications by presenting two interesting use cases: (i) distributed generation of uniform random strings, and (ii) decentralized electronic voting systems, without the presence of a special trusted party.

cs.CR↗

arXiv2023

Recurring Contingent Service Payment

Fair exchange protocols let two mutually distrustful parties exchange digital data in a way that neither party can cheat. They have various applications such as the exchange of digital items, or the exchange of digital coins and digital services between a buyer/client and seller/server. In this work, we formally define and propose a generic blockchain-based construction called "Recurring Contingent Service Payment" (RC-S-P). It (i) lets a fair exchange of digital coins and verifiable service reoccur securely between clients and a server while ensuring that the server is paid if and only if it delivers a valid service, and (ii) ensures the parties' privacy is preserved. RC-S-P supports arbitrary verifiable services, such as "Proofs of Retrievability" (PoR) or verifiable computation and imposes low on-chain overheads. Our formal treatment and construction, for the first time, consider the setting where either client or server is malicious. We also present a concrete efficient instantiation of RC- S-P when the verifiable service is PoR. We implemented the concrete instantiation and analysed its cost. When it deals with a 4-GB outsourced file, a verifier can check a proof in only 90 milliseconds, and a dispute between a prover and verifier is resolved in 0.1 milliseconds. At CCS 2017, two blockchain-based protocols were proposed to support the fair exchange of digital coins and a certain verifiable service; namely, PoR. In this work, we show that these protocols (i) are susceptible to a free-riding attack which enables a client to receive the service without paying the server, and (ii) are not suitable for cases where parties' privacy matters, e.g., when the server's proof status or buyer's file size must remain private from the public. RC- S-P simultaneously mitigates the above attack and preserves the parties' privacy.

cs.CR↗

arXiv2022

Glass-Vault: A Generic Transparent Privacy-preserving Exposure Notification Analytics Platform

The highly transmissible COVID-19 disease is a serious threat to people's health and life. To automate tracing those who have been in close physical contact with newly infected people and/or to analyse tracing-related data, researchers have proposed various ad-hoc programs that require being executed on users' smartphones. Nevertheless, the existing solutions have two primary limitations: (1) lack of generality: for each type of analytic task, a certain kind of data needs to be sent to an analyst; (2) lack of transparency: parties who provide data to an analyst are not necessarily infected individuals; therefore, infected individuals' data can be shared with others (e.g., the analyst) without their fine-grained and direct consent. In this work, we present Glass-Vault, a protocol that addresses both limitations simultaneously. It allows an analyst to run authorised programs over the collected data of infectious users, without learning the input data. Glass-Vault relies on a new variant of generic Functional Encryption that we propose in this work. This new variant, called DD-Steel, offers these two additional properties: dynamic and decentralised. We illustrate the security of both Glass-Vault and DD-Steel in the Universal Composability setting. Glass-Vault is the first UC-secure protocol that allows analysing the data of Exposure Notification users in a privacy-preserving manner. As a sample application, we indicate how it can be used to generate "infection heatmaps".

cs.CR↗

arXiv2022

Blockchain Nash Dynamics and the Pursuit of Compliance

We study Nash-dynamics in the context of blockchain protocols. We introduce a formal model, within which one can assess whether the Nash dynamics can lead utility-maximizing participants to defect from the "honest" protocol operation, towards variations that exhibit one or more undesirable infractions, such as abstaining from participation and producing conflicting protocol histories. Blockchain protocols that do not lead to such infraction states are said to be compliant. Armed with this model, we evaluate the compliance of various Proof-of-Work (PoW) and Proof-of-Stake (PoS) protocol families, with respect to different utility functions and reward schemes, leading to the following results: i) PoS ledgers under resource-proportional rewards can be compliant if costs are negligible, but non-compliant if costs are significant; ii) PoW and PoS under block-proportional rewards exhibit different compliance behavior, depending on the lossiness of the network; iii) PoS ledgers can be compliant w.r.t. one infraction, i.e., producing conflicting messages, but non-compliant (and non-equilibria) w.r.t. abstaining or an attack we call selfish signing; iv) taking externalities, such as exchange rate fluctuations, into account, we quantify the benefit of economic penalties, in the context of PoS protocols, in disincentivizing particular infractions.

cs.CR↗

arXiv2022

Extending the Vocabulary of Fictional Languages using Neural Networks

Fictional languages have become increasingly popular over the recent years appearing in novels, movies, TV shows, comics, and video games. While some of these fictional languages have a complete vocabulary, most do not. We propose a deep learning solution to the problem. Using style transfer and machine translation tools, we generate new words for a given target fictional language, while maintaining the style of its creator, hence extending this language vocabulary.

cs.CL↗

arXiv2018

Observation of Optical Backflow

Backflow is a counter-intuitive phenomenon in which a forward propagating quantum particle propagates locally backwards. The actual counter-propagation property associated with this delicate interference phenomenon has not been observed to date in any field of physics. Here, we report the observation of transverse optical backflow where a beam of light propagating to a specific transverse direction is measured locally to propagate in the opposite direction. This observation is relevant to any physical system supporting coherent waves and might lead to unique applications.

physics.optics↗

arXiv2016

Distributed, End-to-end Verifiable, and Privacy-Preserving Internet Voting Systems

E-voting systems are a powerful technology for improving democracy. Unfortunately, prior voting systems have single points-of-failure, which may compromise availability, privacy, or integrity of the election results. We present the design, implementation, security analysis, and evaluation of the D-DEMOS suite of distributed, privacy-preserving, and end-to-end verifiable e-voting systems. We present two systems: one asynchronous and one with minimal timing assumptions but better performance. Our systems include a distributed vote collection subsystem that does not require cryptographic operations on behalf of the voter. We also include a distributed, replicated and fault-tolerant Bulletin Board component, that stores all necessary election-related information, and allows any party to read and verify the complete election process. Finally, we incorporate trustees, who control result production while guaranteeing privacy and end-to-end-verifiability as long as their strong majority is honest. Our suite of e-voting systems are the first whose voting operation is human verifiable, i.e., a voter can vote over the web, even when her web client stack is potentially unsafe, without sacrificing her privacy, and still be assured her vote was recorded as cast. Additionally, a voter can outsource election auditing to third parties, still without sacrificing privacy. We provide a model and security analysis of the systems, implement complete prototypes, measure their performance experimentally, and demonstrate their ability to handle large-scale elections. Finally, we demonstrate the performance trade-offs between the two versions of the system. A preliminary version of our system was used to conduct exit-polls at three voting sites for two national-level elections and is being adopted for use by the largest civil union of workers in Greece, consisting of over a half million members.

cs.CR↗

arXiv2015

D-DEMOS: A distributed, end-to-end verifiable, internet voting system

E-voting systems have emerged as a powerful technology for improving democracy by reducing election cost, increasing voter participation, and even allowing voters to directly verify the entire election procedure. Prior internet voting systems have single points of failure, which may result in the compromise of availability, voter secrecy, or integrity of the election results. In this paper, we present the design, implementation, security analysis, and evaluation of D-DEMOS, a complete e-voting system that is distributed, privacy-preserving and end-to-end verifiable. Our system includes a fully asynchronous vote collection subsystem that provides immediate assurance to the voter her vote was recorded as cast, without requiring cryptographic operations on behalf of the voter. We also include a distributed, replicated and fault-tolerant Bulletin Board component, that stores all necessary election-related information, and allows any party to read and verify the complete election process. Finally, we also incorporate trustees, i.e., individuals who control election result production while guaranteeing privacy and end-to-end-verifiability as long as their strong majority is honest. Our system is the first e-voting system whose voting operation is human verifiable, i.e., a voter can vote over the web, even when her web client stack is potentially unsafe, without sacrificing her privacy, and still be assured her vote was recorded as cast. Additionally, a voter can outsource election auditing to third parties, still without sacrificing privacy. Finally, as the number of auditors increases, the probability of election fraud going undetected is diminished exponentially. We provide a model and security analysis of the system. We implement a prototype of the complete system, we measure its performance experimentally, and we demonstrate its ability to handle large-scale elections.

cs.CR↗