乐胖代购免代理版

欢迎

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Abstract Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. We

ci

oracle

原创 2023-08-01 23:52:33 82 阅读

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

bstract. A succinct non-interactive argument of knowledge (SNARK)allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of wo

sed

ci

原创 2023-07-22 00:18:23 119 阅读

FS‑PEKS : lattice‑based forward secure public‑key encryption with keyword search for cloud‑assisted

Abstract—Cloud-assisted Industrial Internet of Things (IIoT) relies on cloud computing to provide massive data storage services. Toensure the confidentiality, sensitive industrial data need to be encr

sed

ide

Public

原创 2023-07-21 00:38:55 188 阅读

Efficient Lattice-Based Threshold Signatures With Functional Interchangeability

Abstract— A threshold signature scheme distributes the ability to generate signatures through distributed key generation and signing protocols. A threshold signature scheme should be functionally inte

sed

ci

lua

原创 2023-07-20 00:14:10 164 阅读

Lattice-Based zk-SNARKs from Square Span Programs

BSTRACTZero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and efficiently verifiable proofs. They elegantly resolve the juxtaposition of individual privacy and public trust

sed

ci

ide

原创 2023-07-19 00:02:31 131 阅读

Kryvos: Publicly Tally-Hiding Verifiable E-Voting

Abstract. Elections are an important corner stone of democratic processes. In addition to publishing the final result (e.g., the overall winner), elections typically publish the full tally consisting

ci

ide

sed

原创 2023-07-18 00:18:51 7375 阅读

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

Abstract. A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of w

sed

ci

原创 2023-07-17 00:09:18 152 阅读

Succinct Vector, Polynomial, and Functional Commitments from Lattices

Vector commitment schemes allow a user to commit to a vector of values x ∈ {0, 1} ℓ and later, open up the commitment to a specific set of positions. Both the size of the commitment and the size of th

ci

sed

Boo

原创 2023-07-16 01:08:00 118 阅读

Kryvos: Publicly Tally-Hiding Verifiable E-Voting

Elections are an import corner stone of democratic processes. Besides national or local political elections, elections also often are and have to be carried out in companies, organizations, associatio

sed

ide

ci

原创 2023-07-15 00:19:57 92 阅读

Estimate all the {LWE, NTRU} schemes!

Abstract. We consider all LWE- and NTRU-based encryption, keyencapsulation, and digital signature schemes proposed for standardisation as part of the Post-Quantum Cryptography process run by the US N

sed

ide

原创 2023-07-14 00:49:33 180 阅读

Group Signatures with User-Controlled and Sequential Linkability

Abstract. Group signatures allow users to create signatures on behalfof a group while remaining anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.

ide

Group

sed

原创 2023-07-13 00:01:36 111 阅读

Succinct Vector, Polynomial, and Functional Commitments from Lattices

Abstract Vector commitment schemes allow a user to commit to a vector of values x ∈ {0, 1} ℓ and later, open up the commitment to a specific set of positions. Both the size of the commitment and the s

ci

sed

Boo

原创 2023-07-12 14:08:41 98 阅读

On Homomorphic Secret Sharing from Polynomial-Modulus LWE

Abstract. Homomorphic secret sharing (HSS) is a form of secret sharing that supports the local evaluation of functions on the shares, with applications to multi-server private information retrieval, s

ci

sed

Ring

原创 2023-07-11 02:33:26 104 阅读

Homomorphic Secret Sharing from Lattices Without FHE

Abstract. Homomorphic secret sharing (HSS) is an analog of somewhat- or fully homomorphic encryption (S/FHE) to the setting of secret sharing, with applications including succinct secure computation,

ci

sed

原创 2023-07-10 10:22:01 112 阅读

Group Signatures with User-Controlled and Sequential Linkability

Abstract. Group signatures allow users to create signatures on behalf of a group while remaining anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.

ide

Group

sed

原创 2023-07-09 09:58:27 59 阅读

Ring Signatures with User-Controlled Linkability

Abstract. Anonymous authentication primitives, e.g., group or ring signatures, allow one to realize privacy-preserving data collection applications, as they strike a balance between authenticity of da

ide

sed

User

原创 2023-07-08 00:31:42 140 阅读

Group Signatures with User-Controlled and Sequential Linkability

Abstract. Group signatures allow users to create signatures on behalf of a group while remaining anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.

ide

Group

sed

原创 2023-07-07 14:27:27 78 阅读

Ring Signatures with User-Controlled Linkability

Abstract. Anonymous authentication primitives, e.g., group or ring signatures, allow one to realize privacy-preserving data collection applications, as they strike a balance between authenticity of da

ide

sed

User

原创 2023-07-06 00:03:02 124 阅读

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

Abstract. In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without s

ide

ci

sed

原创 2023-07-05 00:54:00 153 阅读

Group Signatures with User-Controlled and Sequential Linkability

Abstract. Group signatures allow users to create signatures on behalf of a group while remaining anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.

ide

Group

sed

原创 2023-07-04 18:09:19 80 阅读

One-Shot Verifiable Encryption from Lattices

Abstract. Verifiable encryption allows one to prove properties about encrypted data and is an important building block in the design of cryptographic protocols, e.g., group signatures, key escrow, fa

ci

sed

oracle

原创 2023-07-03 16:53:31 75 阅读

p Signatures with User-Controlled and Sequential Linkability

ing anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.g., sensors, wearables or vehicles can upload authenticated measurements into a data lake. Th

ide

原创 2023-07-03 00:02:22 142 阅读

roup Signatures with User-Controlled and Sequential Linkability

oup while remaining anonymous. Such signatures are a powerful tool to realize privacy-preserving data collections, where e.g., sensors, wearables or vehicles can upload authenticated measurements into

ide

原创 2023-07-02 00:45:45 86 阅读

Lattice-Based Group Signatures With Time-Bound Keys via Redactable Signatures

Abstract— Group signatures are active cryptographic topics where group members are granted right to sign messages anonymously on behalf of their group. However, in practical applications, such rights

ci

sed

Computer

原创 2023-06-24 00:07:01 262 阅读

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

Abstract. We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two new h

sed

oracle

ci

原创 2023-06-23 00:03:20 189 阅读

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal

ci

sed

ide

原创 2023-06-22 00:06:13 245 阅读

One-Shot Verifiable Encryption from Lattices

o-knowledge proof of knowledge π showing that he knows the value of Dec(t). Proving knowledge of the value of Dec(t) is usually the same as proving that t is a correctly formed ciphertext along with p

sed

ci

原创 2023-06-21 00:10:05 375 阅读

Lattice Signatures Without Trapdoors

Abstract. We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (STOC 2008). Our

sed

ci

oracle

原创 2023-06-20 01:31:01 363 阅读

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability?

Commitments and zero-knowledge proofs of knowledge (ZKPoK) of committed values are a key ingredient in many privacy-based protocols. It is also often useful to prove various relations among the commit

sed

ide

ci

原创 2023-06-19 00:03:14 268 阅读

Estimate all the {LWE, NTRU} schemes!

Abstract. We consider all LWE- and NTRU-based encryption, key encapsulation, and digital signature schemes proposed for standardisation as part of the Post-Quantum Cryptography process run by the US N

sed

ide

原创 2023-06-18 01:08:17 73 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

qq5f2bca2ab6e17的博客

欢迎

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

FS‑PEKS : lattice‑based forward secure public‑key encryption with keyword search for cloud‑assisted

Efficient Lattice-Based Threshold Signatures With Functional Interchangeability

Lattice-Based zk-SNARKs from Square Span Programs

Kryvos: Publicly Tally-Hiding Verifiable E-Voting

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

Succinct Vector, Polynomial, and Functional Commitments from Lattices

Kryvos: Publicly Tally-Hiding Verifiable E-Voting

Estimate all the {LWE, NTRU} schemes!

Group Signatures with User-Controlled and Sequential Linkability

Succinct Vector, Polynomial, and Functional Commitments from Lattices

On Homomorphic Secret Sharing from Polynomial-Modulus LWE

Homomorphic Secret Sharing from Lattices Without FHE

Group Signatures with User-Controlled and Sequential Linkability

Ring Signatures with User-Controlled Linkability

Group Signatures with User-Controlled and Sequential Linkability

Ring Signatures with User-Controlled Linkability

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

Group Signatures with User-Controlled and Sequential Linkability

One-Shot Verifiable Encryption from Lattices

p Signatures with User-Controlled and Sequential Linkability

roup Signatures with User-Controlled and Sequential Linkability

Lattice-Based Group Signatures With Time-Bound Keys via Redactable Signatures

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

One-Shot Verifiable Encryption from Lattices

Lattice Signatures Without Trapdoors

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability?

Estimate all the {LWE, NTRU} schemes!