A Hardware-Based Correct Execution Environment Supporting Virtual Memory od Daehyeon Lee, Ohsuk Shin, Yeonghyeon Cha, Junghee Lee, Taisic Yun, Jihye Kim, Hyunok Oh, Chrysostomos Nicopoulos, Sang Su Lee

Teme: Polni tekst

Incrementally verifiable computation or knowledge implies time/space efficiency od Valiant, Paul (Paul Andrew)

Polni tekst

C++ toolbox for verified computing I : basic numerical problems / od Hammer, R.

VerSum: Verifiable Computations over Large Public Logs od van den Hooff, Jelle, Kaashoek, M. Frans, Zeldovich, Nickolai

Polni tekst
Polni tekst
Polni tekst
Polni tekst

An efficient polynomial-based verifiable computation scheme on multi-source outsourced data od Yiran Zhang, Huizheng Geng, Li Su, Shen He, Li Lu

“...To improve the efficiency, this paper proposes an efficient polynomial-based verifiable computation scheme on multi-source outsourced data. ...”
Polni tekst

Practical Cryptographically Private and Verifiable Computation through Hardware-Software Co-Design od Samardzic, Nikola

“...Fully Homomorphic Encryption (FHE) and Verifiable Computation (VC) enable offloading computation to untrusted servers with cryptographic privacy and integrity guarantees. ...”
Polni tekst

Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination od Tianpeng ZHANG, Zhiyu REN, Xuehui DU, Haichao WANG

Teme: Polni tekst

Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination od ZHANG Tianpeng, REN Zhiyu, DU Xuehui, WANG Haichao

Teme: Polni tekst

Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination od Tianpeng ZHANG, Zhiyu REN, Xuehui DU, Haichao WANG

Teme: Polni tekst

More Efficient and Verifiable Privacy-Preserving Aggregation Scheme for Internet of Things-Based Federated Learning od Rongquan Shi, Lifei Wei, Lei Zhang

Teme: Polni tekst

Numerical toolbox for verified computing 1 : basic numerical problems : theory, algorithms, and Pascal-XSC programs / od Hammer, R.

PEEV: Parse Encrypt Execute Verify—A Verifiable FHE Framework od Omar Ahmed, Charles Gouert, Nektarios Georgios Tsoutsos

Teme: Polni tekst

Certificateless-based efficient aggregate signature scheme with universal designated verifier od Yu-lei ZHANG, Dong-rui ZHOU, Chen-yi LI, Yong-jie ZHANG, Cai-fen WANG

Teme: “...aggregate signature;certificateless signature;universal designated verifier;computational Diffie-Hellman problem...”
Polni tekst

Investment Compliance in Hedge Funds using Zero Knowledge Proofs od Komal Kalra, Sandeep Kumar Shukla, Shubham Sahai

“...We propose a protocol to address this scenario using Zokrates, a framework for verifiable computation using Zk-SNARKs on Ethereum, to encode the constraints and export the verifier. ...”
Polni tekst

Shorter ZK-SNARKs from square span programs over ideal lattices od Xi Lin, Heyang Cao, Feng-Hao Liu, Zhedong Wang, Mingsheng Wang

“...Abstract Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are cryptographic protocols that offer efficient and privacy-preserving means of verifying NP language relations and have drawn considerable attention for their appealing applications, e.g., verifiable computation and anonymous payment protocol. Compared with the pre-quantum case, the practicability of this primitive in the post-quantum setting is still unsatisfactory, especially for the space complexity. ...”
Polni tekst

Monolith: Circuit-Friendly Hash Functions with New Nonlinear Layers for Fast and Constant-Time Implementations od Lorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger, Markus Schofnegger, Roman Walch

“... Hash functions are a crucial component in incrementally verifiable computation (IVC) protocols and applications. Among those, recursive SNARKs and folding schemes require hash functions to be both fast in native CPU computations and compact in algebraic descriptions (constraints). ...”
Polni tekst

Skyscraper: Fast Hashing on Big Primes od Clémence Bouvier, Lorenzo Grassi, Dmitry Khovratovich, Katharina Koschatko, Christian Rechberger, Fabian Schmid, Markus Schofnegger

“... Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. ...”
Polni tekst

Achieving privacy-preserving and verifiable data sharing in vehicular fog with blockchain od Kong, Qinglei, Su, Le, Ma, Maode

“...During the data collection phase, by combining the homomorphic 2-DNF (Disjunctive Normal Form) cryptosystem and an identity-based signcryption scheme, our proposed scheme achieves the secure and verifiable computation of the average and variance of the collected vehicular sensory data. ...”
Polni tekst

Rate-1 non-interactive arguments for batch-NP od Devadas, Lalita

“...We also observe we can obtain an incrementally verifiable computation (IVC) scheme for arbitrary deterministic computations, even beyond P; a multi-hop BARG scheme for NP; and a multi-hop aggregate signature scheme, in the standard model, with unbounded and universal aggregation. ...”
Polni tekst

Elastic MSM: A Fast, Elastic and Modular Preprocessing Technique for Multi-Scalar Multiplication Algorithm on GPUs od Xudong Zhu, Haoqi He, Zhengbang Yang, Yi Deng, Lutan Zhao, Rui Hou

“...Due to its powerful capabilities, its most practical type, called zero-knowledge Succinct Non-interactive ARgument of Knowledge (zkSNARK), has been widely deployed in various privacypreserving applications such as cryptocurrencies and verifiable computation. Although state-of-the-art zkSNARKs are highly efficient for the verifier, the computational overhead for the prover is still orders of magnitude too high to warrant use in many applications. ...”
Polni tekst