標(biāo)題: Titlebook: Advances in Cryptology – CRYPTO 2024; 44th Annual Internat Leonid Reyzin,Douglas Stebila Conference proceedings 2024 International Associat [打印本頁(yè)] 作者: Affordable 時(shí)間: 2025-3-21 17:21
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024影響因子(影響力)
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024被引頻次
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024被引頻次學(xué)科排名
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024年度引用
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024年度引用學(xué)科排名
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024讀者反饋
書(shū)目名稱(chēng)Advances in Cryptology – CRYPTO 2024讀者反饋學(xué)科排名
作者: 有幫助 時(shí)間: 2025-3-21 22:58
https://doi.org/10.1007/978-3-642-81414-3ure renaming takes . rounds and . secure operations. Our algorithm also outputs in a secret-shared form two arrays: a mapping from integers to alphanumeric names and its sorted inverse. Of course, if the adjacency list is already in such an integer format, this step could be skipped. Second, given a作者: 沙漠 時(shí)間: 2025-3-22 02:02
https://doi.org/10.1007/978-3-662-11927-3e do so by introducing ., which, from the server’s perspective, are computationally indistinguishable from regular PIR queries. Provided that the server succeeds in correctly answering . such validation queries, the client is convinced with probability . that the server is unable to break privacy wi作者: 易發(fā)怒 時(shí)間: 2025-3-22 06:15
Konstruktionslehre des Stahlbetonslandscape of . single-server preprocessing PIR. We make contributions on both the upper- and lower-bounds fronts. First, we show new information-theoretic constructions with various non-trivial performance tradeoffs between server computation, client space and bandwidth. Second, we prove a (nearly) 作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-3-22 10:53
Konstruktionslehre des Stahlbetonseves throughput about 6.37?GB/s without requiring transmission of any client or server state. We additionally formalize the matrix vector multiplication protocol as a novel primitive that we call ., which may be of independent interest..In our second construction (.) we reduce the communication of .作者: 無(wú)表情 時(shí)間: 2025-3-22 14:16 作者: 豎琴 時(shí)間: 2025-3-22 17:48
Forschung als Experiment (G?tz Krummheuer) monotone access structures in ., which is all Boolean function families represented by polynomial-size formulas over some fixed complete basis, leads us to identify a complexity theoretic problem of independent interest..Prior to our work, multi-round composition was either restricted to the random作者: Hyperalgesia 時(shí)間: 2025-3-22 21:12
,Die ?sterreichischen Bundesbahnen,fraction of units in . is 1/2. In this work, we first construct ZK protocols over a high degree Galois ring extension of . (fraction of units close to 1) and then convert them to . efficiently using amortization techniques. Our results greatly change the landscape of ZK protocols over?..作者: 潛移默化 時(shí)間: 2025-3-23 04:41
,Die ?sterreichischen Bundesbahnen,d on the black-box use of cryptographic primitives. Our work is optimal in the use of primitives since we only need one-way functions, and asymptotically optimal in the number of rounds since we only require a constant number of rounds. Our argument system is non-malleable with respect to the strong作者: 狗窩 時(shí)間: 2025-3-23 05:44 作者: falsehood 時(shí)間: 2025-3-23 12:06 作者: 讓空氣進(jìn)入 時(shí)間: 2025-3-23 15:55
Fully Malicious Authenticated PIRe do so by introducing ., which, from the server’s perspective, are computationally indistinguishable from regular PIR queries. Provided that the server succeeds in correctly answering . such validation queries, the client is convinced with probability . that the server is unable to break privacy wi作者: 同步信息 時(shí)間: 2025-3-23 19:15 作者: 情節(jié)劇 時(shí)間: 2025-3-24 01:28 作者: landmark 時(shí)間: 2025-3-24 05:08 作者: Gnrh670 時(shí)間: 2025-3-24 10:21 作者: glisten 時(shí)間: 2025-3-24 11:01
More Efficient Zero-Knowledge Protocols over?, via?Galois Ringsfraction of units in . is 1/2. In this work, we first construct ZK protocols over a high degree Galois ring extension of . (fraction of units close to 1) and then convert them to . efficiently using amortization techniques. Our results greatly change the landscape of ZK protocols over?..作者: 消瘦 時(shí)間: 2025-3-24 17:12 作者: 蛤肉 時(shí)間: 2025-3-24 19:28
0302-9743 y computation;..Part IX: Multiparty computation; private information retrieval; zero-knowledge;..Part X: Succinct arguments...?.978-3-031-68399-2978-3-031-68400-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 強(qiáng)制性 時(shí)間: 2025-3-25 02:07
Conference proceedings 2024VI: Cryptanalysis; new primitives; side-channels and leakage;..Part VII: Quantum cryptography; threshold cryptography;..Part VIII: Multiparty computation;..Part IX: Multiparty computation; private information retrieval; zero-knowledge;..Part X: Succinct arguments...?.作者: Conscientious 時(shí)間: 2025-3-25 05:17
0302-9743 4. The conference took place at Santa Barbara, CA, USA, during August 18-22, 2024...The 143 full papers presented in the proceedings were carefully reviewed and selected from a total of 526 submissions. The papers are organized in the following topical sections:..Part I: Digital signatures;..Part II作者: 共同生活 時(shí)間: 2025-3-25 07:40 作者: GENUS 時(shí)間: 2025-3-25 15:33 作者: 有助于 時(shí)間: 2025-3-25 18:26
Konstruktionslehre des Stahlbetonsrealising more efficient pairing-based SNARKs. We show that considering abelian varieties of dimension larger than 1 unlocks a number of interesting possibilities for finding pairing-friendly cycles, and we give several new constructions that can be instantiated at any security level.作者: 不出名 時(shí)間: 2025-3-25 22:25 作者: osteocytes 時(shí)間: 2025-3-26 03:41 作者: Desert 時(shí)間: 2025-3-26 05:58
Resettable Statistical Zero-Knowledge for? resettable security in a model where the honest party’s randomness is only reused with fixed inputs. We show that resettable statistically hiding commitment schemes are impossible even in this model.作者: 發(fā)炎 時(shí)間: 2025-3-26 08:38 作者: 音樂(lè)等 時(shí)間: 2025-3-26 14:05
Jürgen Christmann,Merle Christmannharya et al. and design and use a suite of carefully defined building blocks that may be of independent interest. The resulting protocol is UC-secure without honest majority, with a CRS and bulletin-board as setups, and allows publicly identifying deviations from correct execution.作者: 贊成你 時(shí)間: 2025-3-26 19:31 作者: BLAND 時(shí)間: 2025-3-26 21:38 作者: 同來(lái)核對(duì) 時(shí)間: 2025-3-27 04:53
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 時(shí)間: 2025-3-27 07:20
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作者: 休息 時(shí)間: 2025-3-27 09:38
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 時(shí)間: 2025-3-27 17:01
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作者: 委派 時(shí)間: 2025-3-27 19:03
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 時(shí)間: 2025-3-27 22:42
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作者: 犬儒主義者 時(shí)間: 2025-3-28 03:34
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 時(shí)間: 2025-3-28 07:19 作者: amyloid 時(shí)間: 2025-3-28 10:56
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作者: 緯線 時(shí)間: 2025-3-28 16:52
CDS Composition of?Multi-round Protocols have multiple rounds of interaction. The goal of CDS composition is to prove compound NP-relations by combining multiple “atomic” proof systems. Its key feature is that it interacts with the atomic proofs in a generic fashion, enabling simpler and more efficient implementation..Recent developments 作者: Definitive 時(shí)間: 2025-3-28 21:00 作者: 熟練 時(shí)間: 2025-3-29 01:05
Black-Box (and Fast) Non-malleable Zero Knowledgeing the security of proof systems against man-in-the-middle attacks..Recently, Kim, Liang, and Pandey (CRYPTO 2022) presented the first efficient constant-round NMZK argument system based solely on symmetric-key cryptography. Their construction relies on a non-black-box use of the involved cryptogra作者: 生氣的邊緣 時(shí)間: 2025-3-29 03:21 作者: filial 時(shí)間: 2025-3-29 08:29 作者: 哀求 時(shí)間: 2025-3-29 11:46 作者: 臥虎藏龍 時(shí)間: 2025-3-29 15:45
https://doi.org/10.1007/978-3-662-11927-3omplexity 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. 作者: Evocative 時(shí)間: 2025-3-29 21:35
Konstruktionslehre des Stahlbetons. 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作者: 遍及 時(shí)間: 2025-3-30 03:26
