Open radio access network (ORAN)-based vehicular networks play a pivotal role in future
traffic data sharing. Due to the openness of the ORAN framework, it is necessary to encrypt …

Transferable e-cash is the most faithful digital analog of physical cash, as it allows users to
transfer coins between them in isolation, that is, without interacting with a bank or a “ledger” …

In this work we resolve the open problem raised by Prabhakaran and Rosulek at CRYPTO
2007, and present the first anonymous, rerandomizable, Replayable-CCA (RCCA) secure …

Mix-nets are protocols that allow a set of senders to send messages anonymously. Faonio et
al.(ASIACRYPT'19) showed how to instantiate mix-net protocols based on Public-Verifiable …

Public key encryption schemes that are simultaneously re-randomizable and replayable
CCA (Rand-RCCA) secure offer a unique combination of malleability and non-malleability …

We give an efficient construction of a computational non-interactive witness
indistinguishable (NIWI) proof in the plain model, and investigate notions of extraction for …

The Snowden revelations in 2013 showed that user machines running cryptographic
protocols might be stealthily corrupted by attackers (eg, manufacturers and supply-chain …

A shuffle argument is a cryptographic primitive for proving correct behaviour of mix-networks
without leaking any private information. Several recent constructions of non-interactive …

A mixnet developed by Hébant et al.(PKC'20) employs certified ciphertexts that carry
homomorphic signatures from an authority, reducing the complexity of the shuffling proof …

Re-randomizable Replayable CCA-secure public key encryption (Rand-RCCA PKE)
schemes guarantee security against chosen-ciphertext attacks while ensuring the useful …