Výsledky vyhľadávania - Theory of computation Computational complexity and cryptography Cryptographic protocols

Primer: Fast Private Transformer Inference on Encrypted Data Autor Zheng, Mengxin, Lou, Qian, Jiang, Lei

“… In particular, Primer is constructed by a hybrid cryptographic protocol optimized for attention-based Transformer models, as well as techniques including computation merge and tokens-first ciphertext packing…”
Získať plný text

Optimizing windowed arithmetic for quantum attacks against RSA-2048 Autor Luongo, Alessandro, Narasimhachar, Varun, Sireesh, Adithya

“… in the current state-of-the-art compilations of quantum attacks against modern cryptography. We introduce several optimizations to windowed arithmetic…”
Získať plný text

ZK-Hammer: Leaking Secrets from Zero-Knowledge Proofs via Rowhammer Autor Liang, Junkai, Zhang, Xin, Hu, Daqi, Shen, Qingni, Fang, Yuejian, Wu, Zhonghai

“…Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK) schemes have been a promising technique in verified computation…”
Získať plný text

zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing Autor Zhang, Yancheng, Zheng, Mengxin, Chen, Xun, Hu, Jingtong, Shi, Weidong, Ju, Lei, Solihin, Yan, Lou, Qian

“… However, the computation, data and results are prone to tampering due to the vulnerabilities on the server side…”
Získať plný text

Optimized Polynomial Multiplier Architectures for Post-Quantum KEM Saber Autor Basso, Andrea, Roy, Sujoy Sinha

“…Saber is one of the four finalists in the ongoing NIST post-quantum cryptography standardization project…”
Získať plný text

ALLMod: Exploring Area-Efficiency of LUT-based Large Number Modular Reduction via Hybrid Workloads Autor Liu, Fangxin, Li, Haomin, Wang, Zongwu, Zhang, Bo, Zhang, Mingzhe, Yan, Shoumeng, Jiang, Li, Guan, Haibing

“…Modular arithmetic, particularly modular reduction, is widely used in cryptographic applications such as homomorphic encryption…”
Získať plný text

Invited: Accelerating Fully Homomorphic Encryption with Processing in Memory Autor Gupta, Saransh, Rosing, Tajana Simunic

“…Fully homomorphic encryption (FHE) provides a promising solution for future computing needs by allowing privacy-preserving computation…”
Získať plný text

Lightning Talk: The Incredible Shrinking Black Box Model Autor Schaumont, Patrick

“…A black box model is an assumption on the implementation of a cryptographic primitive to limit the capabilities of the attacker…”
Získať plný text

NECTAR: non-interactive smart contract protocol using blockchain technology Autor Covaci, Alexandra, Madeo, Simone, Motylinski, Patrick, Vincent, Stéphane

“… In this paper, we introduce a novel protocol aiming to execute smart contracts as part of a blockchain transaction validation…”
Získať plný text

Evaluating the Integration of Aurora Zksnark in the Zupply Framework Autor Badakhshan, Mohammadtaghi, Gong, Guang

“…The Zupply framework introduces an anonymous authentication protocol that utilizes zero-knowledge proofs to ensure data integrity, participant anonymity, and unlinkability within supply chains…”
Získať plný text

Decentralized Electronic Health Records Management via Redactable Blockchain and Revocable IPFS Autor Guo, Hao, Li, Wanxin, Meese, Collin, Nejad, Mark

“… We implemented the proposed system based on the Charm cryptographic library and revocable…”
Získať plný text

Interactive cryptographic proofs of quantumness using mid-circuit measurements Autor Zhu, Daiwei, Kahanamoku-Meyer, Gregory D, Lewis, Laura, Noel, Crystal, Katz, Or, Harraz, Bahaa, Wang, Qingfeng, Risinger, Andrew, Feng, Lei, Biswas, Debopriyo, Egan, Laird, Gheorghiu, Alexandru, Nam, Yunseong, Vidick, Thomas, Vazirani, Umesh, Yao, Norman Y, Cetina, Marko, Monroe, Christopher

“… Here we apply mid-circuit measurements for a particular task: demonstrating quantum computational advantage…”
Získať plný text

Secure Comparison Protocols in the Semi-Honest Model Autor Veugen, Thijs, Blom, Frank, de Hoogh, Sebastiaan J. A., Erkin, Zekeriya

“…Due to high complexity, comparison protocols with secret inputs have been a bottleneck in the design of privacy-preserving cryptographic protocols…”
Získať plný text

Probabilistic Termination and Composability of Cryptographic Protocols Autor Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis

“…When analyzing the round complexity of multi-party protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement…”
Získať plný text

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols Autor Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis

“…An important benchmark for multi-party computation protocols (MPC) is their round complexity…”
Získať plný text

More Efficient Oblivious Transfer Extensions Autor Asharov, Gilad, Lindell, Yehuda, Schneider, Thomas, Zohner, Michael

“…Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation…”
Získať plný text

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency Autor Applebaum, Benny, Kachlon, Eliran, Patra, Arpita

“… We study the round complexity of general secure multiparty computation in the BGW model. Our main result shows that every functionality can be realized in only four…”
Získať plný text

Verification of Quantum Computation: An Overview of Existing Approaches Autor Gheorghiu, Alexandru, Kapourniotis, Theodoros, Kashefi, Elham

“… We also comment on the use of cryptographic techniques which, for many of the presented protocols, has proven extremely useful in performing verification. Finally, we discuss issues related to fault tolerance, experimental implementations and the outlook for future protocols…”
Získať plný text

A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems Autor Cortier, Véronique, Kremer, Steve, Warinschi, Bogdan

“… One of the approaches relies on a computational model that considers issues of complexity and probability…”
Získať plný text

Decision and Complexity of Dolev-Yao Hyperproperties Autor Rakotonirina, Itsaka, Barthe, Gilles, Schneidewind, Clara

“…The formal analysis of cryptographic protocols traditionally focuses on trace and equivalence properties, for which decision procedures in the symbolic (or Dolev-Yao, or DY) model are known…”
Získať plný text