J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In Proc. of ACM STOC'90, pp.387-394, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Physically Observable Cryptography - Micali, Reyzin (2003) (7 citations) (Correct)
....then forge digital signatures at will. More recently, however, the sophisticated reduction techniques of complexity theoretic cryptography have shut the door to such attacks. For instance, if one way functions exist, fundamental tools such as pseudorandom generation [15] and digital signatures [24, 21] can be implemented so as to be provably secure against all non physical attacks. Unfortunately, other realistic and more powerful attacks exist. PHYSICAL OBSERVATION ATTACKS. In reality, a cryptographic algorithm A must be run in a physical device P , and, quite outside of our control, the ....
John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 387--394, Baltimore, Maryland, 14--16 May 1990.
Strengthening Zero-Knowledge Protocols using Signatures - Garay, MacKenzie, Yang (2003) (7 citations) (Correct)
....a universally composable ZK protocol. The main transformations (sufficient to achieve all results except for UCZK protocols secure in the adaptive model) use a signature scheme that is existentially unforgeable against adaptive chosenmessage attacks [33] which exists if one way functions exist [50], as well as a Sigma protocol to prove knowledge of a signature. Note that one way functions can be used to construct commitments, and thus if one way functions exist, Sigma protocols exist for any NP statement (say, through a Cook Levin reduction, and a standard Sigma protocol for Hamiltonian ....
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd ACM Symp. on Theory of Computing, pp. 387--394, 1990.
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) (Correct)
No context found.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In Proc. of ACM STOC'90, pp.387-394, 1990.
Invariant Signatures and - Non-Interactive Zero-Knowledge Proofs (Correct)
No context found.
J. Rompel "One-way Functions are Necessary and Sufficient for Secure Signatures" STOC 90. 21
One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (1 citation) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. of the 22nd Annu. ACM Symp. on the Theory of Computing, pages 387--394, 1990.
Perfect Zero-Knowledge Arguments for NP Can Be Based .. - Naor, Ostrovsky.. (1992) (12 citations) (Correct)
No context found.
J. Rompel "One-way Functions are Necessary and Sufficient for Secure Signatures " STOC 90.
One-Way Functions, Hard on Average Problems, and Statistical.. - Ostrovsky (2 citations) (Correct)
No context found.
J. Rompel "One-way functions are Necessary and Sufficient for Secure Signatures" STOC 90.
Public-Key Cryptosystems - From Lattice Reduction (1996) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 1990, pp. 387-394.
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000) (16 citations) (Correct)
No context found.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In Proc. of 22nd STOC, 1990.
Reactively Secure Signature Schemes - Backes, Pfitzmann, Waidner (2003) (6 citations) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 387--394, 1990.
Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004) (1 citation) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 387--394, 1990.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) (Correct)
No context found.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In 22nd ACM Symposium on the Theory of Computing, 1990, pages 387--394.
Construction of a Pseudo-Random Generator - From Any One-Way (Correct)
No context found.
Rompel, J., "One-way Functions are Necessary and Sufficient for Secure Signatures", STOC, 1990, pp 387-394.
Structural Properties of One-Way Hash Functions - Zheng, Matsumoto, Imai (1990) (4 citations) (Correct)
No context found.
J. Rompel: "One-way functions are necessary and sufficient for secure signatures ", Proceedings of the 22-nd ACM Symposium on Theory of Computing, 1990, pp.387-394.
Reactively Secure Signature Schemes - Backes, Pfitzmann, Waidner (2003) (6 citations) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 387--394, 1990. 11
On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003) (5 citations) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd ACM Symp. on Theory of Computing, pp. 387--394, 1990.
Reusing Shares in Secret Sharing Schemes - Zheng, Hardjono, Seberry (1994) (3 citations) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22-nd ACM Symposium on Theory of Computing, pages 387--394, 1990.
Sibling Intractable Function Families - And Their Applications (Correct)
No context found.
Rompel, J. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22-nd ACM Symposium on Theory of Computing (1990), pp. 387-- 394.
Unknown - Tr Electronic Colloquium (1996) (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 1990, pp. 387-394.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) (Correct)
No context found.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In 22nd ACM Symposium on the Theory of Computing, 1990, pages 387--394.
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000) (16 citations) (Correct)
No context found.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In Proc. of 22nd STOC, 1990.
Sibling Intractable Function Families and Their.. - Zheng, Hardjono.. (1992) (1 citation) (Correct)
No context found.
Rompel, J. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22-nd ACM Symposium on Theory of Computing (1990), pp. 387--394.
On Statistical Query Sampling and NMR Quantum Computing - Blum, Yang (Correct)
No context found.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd ACM Symposium on the Theory of Computing, pp. 387--394, 1990.
Interactive Hashing Simplifies Zero-Knowledge Protocol.. - Ostrovsky, Venkatesan, .. (1998) (6 citations) (Correct)
No context found.
J. Rompel "One-way Functions are Necessary and Sufficient for Secure Signatures" STOC 90.
Efficient Consistency Proofs on a Committed Database - Ostrovsky, Rackoff, Smith (2003) (Correct)
No context found.
J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. STOC '90. 25
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC