Titlebook: Advances in Cryptology – CRYPTO 2024; 44th Annual Internat Leonid Reyzin,Douglas Stebila Conference proceedings 2024 International Associat

BLAND

同來核對(duì)

10-Party Sublinear Secure Computation from?Standard Assumptionsion output. A long-running challenge is understanding the required communication complexity of such protocols . in particular, when communication can be . in the circuit representation size?of the desired function. While several techniques have demonstrated the viability?of sublinear secure computat

Amenable

Privacy-Preserving Dijkstraecret-shared representation, so-called . (which we abbreviate to .), where the size of our new data-structure is only 4x larger – compared to the original (secret-shared adjacency list) representation of .. Yet, this new data structure enables us to execute oblivious graph algorithms that simultaneo

休息

Fully Malicious Authenticated PIRomplexity sublinear in ., with the added guarantee that the retrieved item is consistent with the committed database. A crucial requirement is ., i.e., the server should not learn anything about a query . if it learns whether the client aborts..This problem was recently considered by Colombo et al.

dandruff

PIR with?Client-Side Preprocessing: Information-Theoretic Constructions and?Lower Bounds. Moreover, any such single-server PIR with sublinear bandwidth must rely on public-key cryptography. Several recent works showed that these barriers pertaining to classical PIR can be overcome by introducing a preprocessing phase where each client downloads a small hint that helps it make queries s

委派

Hintless Single-Server Private Information Retrievalg or store any database dependent information, and the server does not need to store any client-dependent information..Our first construction (.) eliminates the client preprocessing step from the recent LWE-based SimplePIR (Henzinger et al., USENIX Security 2023) by outsourcing the “hint” related co

antiquated

On Cycles of?Pairing-Friendly Abelian Varieties cycle consists of two elliptic curves . and . that both have a low embedding degree and also satisfy . and .. These constraints turn out to be rather restrictive; in the decade that has passed since 2-cycles were first proposed for use in proof systems, no new constructions of 2-cycles have been fo

犬儒主義者

Oblivious Issuance of?Proofsverifier. The resulting proof cannot be linked back to the interaction that produced it, and can be verified non-interactively by anyone. This notion generalizes common approaches to designing blind signatures, which can be seen as the special case of proving “knowledge of a signing key”, and extend

Infraction

amyloid

Amplification of?Non-interactive Zero Knowledge, Revisited (CRYPTO 2019) stated that if . for some constants ., then .-weak NIZK can be turned into fully-secure NIZK, assuming .. Later, however, they have discovered a gap in their proof..We revisit the problem of NIZK amplification:.Our results take a different route than that of Goyal, Jain, and Sahai. Th