A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Co-sound Zero-Knowledge with Public Keys
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
As already specified in [5] (we include here part of their discussion), in noninteractive arguments with perfect zero-knowledge, co-soundness makes sense comparably to standard soundness. ...
The protocols that we will consider in this work are zero-knowledge argument systems and we will focus on models with public keys since they include two notable examples of quasi-secure protocols. ...
zero knowledge). ...
doi:10.1007/978-3-642-02384-2_18
fatcat:ldujmyrsnjh3raqm347lodxa5y
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
1997
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
., computationally convincing proofs) of knowledge is also explored. shown to be zero-knowledge interactive proofs of knowledge. ...
A four-move protocol for quadratic residuosity is proposed and a new notion of practical soundness is introduced based on its application to a cryptographic identification scheme. ...
Zf a language L has a perfect zero-knowledge interactive proof of lunguuges, then the language L is in CO-S&~?. Remark 7.3. ...
doi:10.1016/s0304-3975(96)00277-0
fatcat:yswo7wkljbcsdekcgdcpiabeyy
Zero knowledge proofs for cloud storage integrity checking
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, how to define zero-knowledge proof algorithms for stored data integrity check has not been formally defined and investigated. ...
In this paper, we introduce a novel definition of data privacy for integrity checks, which describes very high security of a zero-knowledge proof. ...
Definition 2 We say a witness Zero Knowledge Proof DIC protocol is ǫ-sound if Pr[B outputs True] ≤ ǫ. Below we prove that our DIC protocol is sound under the co-CDH assumption. ...
arXiv:1912.00446v1
fatcat:56orcmvgrvflhjhswivkfgg5qa
Constant Size Ring Signature Without Random Oracle
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The scheme meets strongest security requirements, viz. anonymity under full key exposure and unforgeability against insider-corruption without using random oracle under simple hardness assumptions. ...
The set membership proof technique is correct, perfectly sound and zero-knowledge. ...
and zero-knowledge ...
doi:10.1007/978-3-319-19962-7_14
fatcat:fcscfw2gabdqrcu4inxksozfsu
Making Sigma-Protocols Non-interactive Without Random Oracles
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Damgård, Fazio and Nicolosi (TCC 2006 ) gave a transformation of Sigma-protocols, 3-move honest verifier zero-knowledge proofs, into efficient non-interactive zero-knowledge arguments for a designated ...
This yields a voting system with homomorphic tallying that does not rely on the Fiat-Shamir heuristic. ...
(G, P, V) is said to be a non-interactive designated verifier zero-knowledge argument system for R with culpable soundness with respect to R guilt if it is complete, culpably sound and zero-knowledge as ...
doi:10.1007/978-3-662-46447-2_29
fatcat:m2hizuryardtzk7fq7rcet4dn4
Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we firstly introduce a generic technique for non-interactive zero-knowledge plaintext equality and inequality proofs. ...
In our setting, the prover is given two ciphertexts and some trapdoor information, but neither has access to the decryption key nor the randomness used to produce the respective ciphertexts. ...
zero-knowledge proofs about plaintext equality and inequality with respect to any two ciphertexts under the same public key. ...
doi:10.1007/978-3-319-29485-8_8
fatcat:liz2fln6g5b35ezyugku73f36i
Designated Confirmer Signatures with Unified Verification
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Then, we present the first DCS scheme with unified verification and prove its security in the random oracle (RO) model and under a new computational assumption, called Decisional Co-efficient Linear (D-co-L ...
The proposed scheme is constructed by encrypting Boneh, Lynn and Shacham's pairing based short signatures with signed ElGamal encryption. ...
Σprotocols (i.e., 3-round public-coin special honest verifier interactive zero-knowledge (HVIZK) with special soundness) directly. ...
doi:10.1007/978-3-642-25516-8_28
fatcat:sbskkhgoovfi7aktlbizrqomx4
Authentication Schemes Using Polynomials Over Non-Commutative Rings
2012
International Journal on Cryptography and Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:1301.2010v1 fatcat:3r7nvlu4ivdq5noeqgcxzulsxu
By doing so, one can implement authentication schemes, one of them being zero-knowledge interactive proofs of knowledge, on multiplicative structure of the ring. ...
The key idea of the schemes is that for a given non-commutative ring; one can build polynomials on additive structure and takes them as underlying work structure. ...
SECURITY ANALYSIS In this subsection, the completeness, soundness and zero knowledge of the proposed scheme are examined. ...
doi:10.5121/ijcis.2012.2406
fatcat:cv6v3rpqtzhfffhifehnzgvlae
New Techniques for Noninteractive Zero-Knowledge
2012
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Non-interactive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including CCA2-secure cryptosystems, digital signatures, and various cryptographic ...
The new techniques also allow us to answer long standing open questions in the theory of non-interactive zero-knowledge. • We construct the first perfect NIZK argument system for all NP languages. • We ...
Perfect zeroknowledge and perfect non-erasure zero-knowledge follows from Lemma 8. This leaves us with the question of soundness. ...
doi:10.1145/2220357.2220358
fatcat:bnhpfcirsnd6jkysxbsmxizdaa
An Improved Zero-knowledge Identification Scheme based on Quasi-Dyadic Codes
2016
International Journal of Security and Its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
And the security analyses show that the proposed scheme meet with the completeness, soundness and zero-knowledge properties. ...
Section 5 proves the completeness, zero-knowledge and soundness of the scheme. In Section 6 we discuss the performance of the scheme and make comparisons with the aforementioned schemes. ...
Zero-Knowledge: The zero-knowledge property is that no information can be deduced from the protocol in polynomial time except the knowledge of the public data. ...
doi:10.14257/ijsia.2016.10.10.17
fatcat:ih7skrv62fcg7ddyttnazwmgyq
A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Differently from Groth and Lu who only prove the co-soundness of their argument under purely computational assumptions, we prove computational soundness under a necessary knowledge assumption. ...
We propose a new non-interactive (perfect) zero-knowledge (NIZK) shuffle argument that, when compared the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor ...
Public-key cryptosystem. ...
doi:10.1007/978-3-642-32928-9_27
fatcat:n7jhiisz3zdkpkvh5kls3eedr4
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
2013
Journal of Computer Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Differently from Groth and Lu who only prove the co-soundness of their argument under purely computational assumptions, we prove computational soundness under a necessary knowledge assumption. ...
We propose a new non-interactive (perfect) zero-knowledge (NIZK) shuffle argument that, when compared the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor ...
Public-key cryptosystem. ...
doi:10.3233/jcs-130478
fatcat:dachfvqsanf7jj63qhlhrhavzq
Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity
2008
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Fractal based zero-knowledge protocol was an attractive alternative to the traditional number theory zero-knowledge protocol. ...
In the proposed protocol, the private key was used as an input parameter for Mandelbrot Fractal function to generate the corresponding public key. ...
( )) [12] Juliafn image with the cosine function (cos( ))
Fig. 5 : 5 A credentials J (card ID, validity, bank account number, etc.) as a public key • An exponent v • A modulus n, which is the product ...
doi:10.3844/jcssp.2008.408.414
fatcat:nym6czy3dnepjmvkdcfu5ovn7a
An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In addition, the signer is able to delegate the ability to prove validity and convert signatures to a semi-trusted third party by providing a verification key. ...
Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures ...
into a perfect zero-knowledge proof of knowledge. ...
doi:10.1007/978-3-642-12827-1_21
fatcat:elyhyzq2lvcqbpw3t6ipbtugz4
Group signature with time-bound keys and unforgeability of expiry time for smart cities
2021
EURASIP Journal on Wireless Communications and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Unforgeability of expiry time disables a revoked signer to create a valid signature by means of associating the signing key with an expiry time. ...
Mitigating the security risks of data and the computing limitation of edge devices, especially identity authentication and key validity management of group devices are essential for IoT system security ...
; NIZK: Noninteractive zero-knowledge proof; PKE: Public key encryption; RGS: Revocable group signature; RC: Revocation check; KOSK: The knowledge of secret key; TBK: Time-bound key; GS-TBK: Group signature ...
doi:10.1186/s13638-021-01948-w
doaj:43e5f232487c4f019df0f8555230625c
fatcat:x7kgp6vnc5gk5iz3h37zvpxwpy
« Previous
Showing results 1 — 15 out of 69,659 results