Jan 1, 1995
· Lecture notes in computer science 0 cites
Anonymous NIZK Proofs of Knowledge with Preprocessing Stefano D’Amiano, Giovanni Di Crescenzo
No abstract is available for this record.
Open access
Cryptography and Data Security
Security and Verification in Computing
Cryptography and Residue Arithmetic
Original source Jan 1, 1995
· Lecture notes in computer science 12 cites
How to Break Another “Provably Secure” Payment System Birgit Pfitzmann, Matthias Schunter, Michael Waidner
No abstract is available for this record.
Open access
Cryptography and Data Security
Cryptographic Implementations and Security
Advanced Authentication Protocols Security
Original source Jan 1, 1995
· Lecture notes in computer science 44 cites
Multiplicative non-abelian sharing schemes and their application to threshold cryptography Yvo Desmedt, Giovanni Di Crescenzo, Mike Burmester
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
graph theory and CDMA systems
Original source Jan 1, 1995
· Lecture notes in computer science 54 cites
Improved Efficient Arguments Joe Kilian
No abstract is available for this record.
Open access
Cryptography and Data Security
Complexity and Algorithms in Graphs
Blockchain Technology Applications and Security
Original source Jan 1, 1995
· Lecture notes in computer science 33 cites
Methodology for digital money based on general cryptographic tools Stefano D’Amiano, Giovanni Di Crescenzo
No abstract is available for this record.
Open access
Cryptography and Data Security
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Original source Jan 1, 1995
· Combinatorics Advances 0 cites
Zero-Knowledge Proofs for Independent Set and Dominating Set Problems Javad Mohajeri
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Internet Traffic Analysis and Secure E-voting
Original source Jan 1, 1995
· Lecture notes in computer science 7 cites
Recycling Random Bits in Composed Perfect Zero-Knowledge Giovanni Di Crescenzo
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Privacy-Preserving Technologies in Data
Original source Jan 1, 1995
· Lecture notes in computer science 165 cites
Committed Oblivious Transfer and Private Multi-Party Computation Claude Crépeau, Jeroen van de Graaf, Alain Tapp
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Internet Traffic Analysis and Secure E-voting
Original source Jan 1, 1995
· Lecture notes in computer science 8 cites
Parallel divertibility of proofs of knowledge Lidong Chen, Ivan Damgård, Torben Pryds Pedersen
No abstract is available for this record.
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Complexity and Algorithms in Graphs
Original source Jan 1, 1995
· Lecture notes in computer science 212 cites
Designated confirmer signatures David Chaum
No abstract is available for this record.
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Complexity and Algorithms in Graphs
Original source Jan 1, 1995
· Lecture notes in computer science 1 cites
Zero-knowledge proofs of computational power in the shared string model Alfredo De Santis, Tatsuaki Okamoto, Giuseppe Persiano
No abstract is available for this record.
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Cloud Data Security Solutions
Original source Jan 1, 1995
· Lecture notes in computer science 44 cites
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Internet Traffic Analysis and Secure E-voting
Original source Dec 1, 1994
· Journal of Cryptology 602 cites
Definitions and properties of zero-knowledge proof systems Oded Goldreich, Yair Oren
No abstract is available for this record.
2 source records
Cryptography and Data Security
Cryptographic Implementations and Security
Security and Verification in Computing
Original source Sep 3, 1994
· Algorithms and combinatorics 14 cites
Probabilistic Proof Systems Oded Goldreich
A proof is whatever convinces me. Shimon Even (1935–2004) The glory attached to the creativity involved in finding proofs makes us forget that it is the less glorified process of verification that gives proofs their value. Conceptually speaking, proofs are secondary to the verification process, whereas technically speaking, proof systems are defined in terms of their verification procedures. The notion of a verification procedure presumes the notion of computation and furthermore the notion of efficient computation. This implicit stipulation is made explicit in the definition of NP , where efficient computation is associated with deterministic polynomial-time algorithms. However, as argued next, we can gain a lot if we are willing to take a somewhat non-traditional step and allow probabilistic verification procedures. In this chapter, we shall study three types of probabilistic proof systems, called interactive proofs, zero-knowledge proofs , and probabilistic checkable proofs . In each of these three cases, we shall present fascinating results that cannot be obtained when considering the analogous deterministic proof systems. Summary: The association of efficient procedures with deterministic polynomial-time procedures is the basis for viewing NP-proof systems as the canonical formulation of proof systems (with efficient verification procedures). Allowing probabilistic verification procedures and, moreover, ruling by statistical evidence gives rise to various types of probabilistic proof systems. Indeed, these probabilistic proof systems carry a probability of error (which is explicitly bounded and can be reduced by successive applications of the proof system), yet they offer various advantages over the traditional (deterministic and errorless) proof systems. […]
Open access
4 source records
Logic, Reasoning, and Knowledge
Semantic Web and Ontologies
Advanced Database Systems and Queries
Original source Sep 1, 1994
· Theoretical Computer Science 27 cites
The knowledge complexity of quadratic residuosity languages Alfredo De Santis, Giovanni Di Crescenzo, Guiseppe Persiano
No abstract is available for this record.
Open access
Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptographic Implementations and Security
Original source Apr 1, 1994
· Information Processing Letters 7 cites
Round-optimal perfect zero-knowledge proofs Giovanni Di Crescenco, Giuseppe Persiano
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptography and Residue Arithmetic
Original source Jan 25, 1994
· IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences 0 cites
On the Knowledge Tightness of Zero-Knowledge Proofs (Special Section on Cryptography and Information Security) Toshiya Itoh, Atsushi Kawakubo
No abstract is available for this record.
Jan 25, 1994
· IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences 0 cites
On the knowledge tightness of zero-knowledge proofs Toshiya Itoh, Atsushi Kawakubo
No abstract is available for this record.
Cryptography and Data Security
Logic, Reasoning, and Knowledge
Original source Jan 1, 1994
· Lecture notes in computer science 6 cites
A non-interactive electronic cash system Giovanni Di Crescenzo
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Computability, Logic, AI Algorithms
Original source Jan 1, 1994
· DSpace@MIT (Massachusetts Institute of Technology) 0 cites
Secret-chain zero-knowledge proofs and their applications Tony L Eng
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Open access
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Cloud Data Security Solutions
Original source Jan 1, 1994
· Lecture notes in computer science 29 cites
Secret Sharing and Perfect Zero Knowledge Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Privacy-Preserving Technologies in Data
Original source Jan 1, 1994
· Lecture notes in computer science 344 cites
A new identification scheme based on syndrome decoding Jacques Stern
No abstract is available for this record.
Coding theory and cryptography
Cryptography and Data Security
graph theory and CDMA systems
Original source Jun 1, 1993
· Journal of Cryptology 11 cites
On the communication complexity of zero-knowledge proofs Joan Boyar, Carsten Lund, René Peralta
No abstract is available for this record.
Open access
Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptographic Implementations and Security
Original source Jun 1, 1993
· Journal of Cryptology 33 cites
A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm Oded Goldreich, Eyal Kushilevitz
No abstract is available for this record.
Cryptography and Data Security
Complexity and Algorithms in Graphs
Logic, Reasoning, and Knowledge
Original source