Results 211 to 220 of about 94,746 (270)
Some of the next articles are maybe not open access.
Vector and Functional Commitments from Lattices
2021Vector commitment (VC) schemes allow one to commit concisely to an ordered sequence of values, so that the values at desired positions can later be proved concisely. In addition, a VC can be statelessly updatable, meaning that commitments and proofs can be updated to reflect changes to individual entries, using knowledge of just those changes (and not ...
Chris Peikert, Zachary Pepin, Chad Sharp
openaire +1 more source
A lattice-based vector commitment and key-value commitment with homomorphic properties
2022We continue the study of vector commitments (VC) and key-value commitments (KVC) by proposing a lattice-based vector commitment and key-value commitment. Generally speaking, a vector commitment is a scheme that allows one to commit to an ordered set and later on be able to open a position in a verifiable manner by producing a corresponding proof.
openaire +2 more sources
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
2022Vector Commitments allow one to (concisely) commit to a vector of messages so that one can later (concisely) open the commitment at selected locations. In the state of the art of vector commitments, algebraic constructions have emerged as a particularly useful class, as they enable advanced properties, such as stateless updates, subvector openings and ...
Dario Catalano +3 more
openaire +1 more source
Vector Commitments over Rings and Compressed Σ -Protocols
2022Compressed Sigma -Protocol Theory (CRYPTO 2020) presents an “alternative” to Bulletproofs that achieves the same communication complexity while adhering more elegantly to existing Sigma -protocol theory, which enables their techniques to be directly applicable to other widely used settings in the context of “plug & play” algorithmics.
Attema, Thomas +4 more
openaire +3 more sources
Exploring social network privacy measurement using fuzzy vector commitment
Intelligent Decision Technologies, 2016Social network is an exciting online community for sharing the moments, opinion and comments. This tendency of having a unanimous person as a friend or as an acquaintance could be a serious threat to the security aspects of social network and the privacy and confidentiality of information may also become vulnerable.
Sarkar, Manash, Banerjee, Soumya
openaire +1 more source
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage
2020Vector commitments with subvector openings (SVC) [Lai-Malavolta, Boneh-Bunz-Fisch; CRYPTO’19] allow one to open a committed vector at a set of positions with an opening of size independent of both the vector’s length and the number of opened positions. We continue the study of SVC with two goals in mind: improving their efficiency and making them more ...
Campanelli, Matteo +4 more
openaire +3 more sources
Revocable Group Signatures with Compact Revocation List Using Vector Commitments
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017A group signature allows any group member to anonymously sign a message. One of the important issues is an efficient membership revocation. The scheme proposed by Libert et al. has achieved O(1) signature and membership certificate size, O(1) signing and verification times, and \(O(\log N)\) public key size, where N is the total number of members ...
Shahidatul SADIAH, Toru NAKANISHI
openaire +1 more source
Speeding Up Revocable Group Signature with Compact Revocation List Using Vector Commitments
2018 Sixth International Symposium on Computing and Networking (CANDAR), 2018In ID-based user authentications, a privacy problem can occur, since the service provider (SP) can accumulate the user's use history from the user ID. As a solution to that problem, group signatures are researched. One of important issues in the group signatures is the user revocation. Previously, an efficient revocable scheme with signing/verification
Yasuyuki SEITA, Toru NAKANISHI
openaire +1 more source
Implementation of Revocable Group Signatures with Compact Revocation List Using Vector Commitments
2017 Fifth International Symposium on Computing and Networking (CANDAR), 2017Group signature schemes allow members to anonymously sign messages on behalf of the group. In this scheme, an efficient membership revocation is one of the important issues. The scheme proposed by Libert et al. has achieved O(1) signature and membership certificate size, O(1) signing and verification times, and O(log N) public key size, where N is the ...
Shahidatul Sadiah, Toru Nakanishi
openaire +1 more source
This thesis studies vector commitments (VCs), a cryptographic primitive that allows a user to generate a succinct digest (commitment) to a vector of values. Using the digest, a user can generate proofs convincing a verifier of an arbitrary entry value in the committed vector. VCs have important decentralized and privacy-preserving applications, such as
openaire +1 more source
openaire +1 more source