Certifying trapdoor permutations, revisited
type: Item
instance of: scholarly article
title: Certifying trapdoor permutations, revisited
zbMATH Open document ID: 1443.94049
DOI: 10.1007/978-3-030-03807-6_18
author: Ran Canetti
author: Amit Lichtenberg
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6992102
zbMATH Keywords: non-interactive zero-knowledge
zbMATH Keywords: trapdoor permutations
zbMATH Keywords: indistinguishability obfuscation
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 18
OpenAlex ID: W2728974496
cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
cites work: Q3210163
cites work: Q4783716
cites work: Functional Signatures and Pseudorandom Functions
cites work: Weak Verifiable Random Functions
cites work: Q3840150
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Perfect Structure on the Edge of Chaos
cites work: Noninteractive Zero-Knowledge
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
cites work: Q4434880
cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
cites work: New directions in cryptography
cites work: Zaps and Their Applications
cites work: Q3729902
cites work: Probabilistic encryption
cites work: Q4318696
cites work: Foundations of Cryptography
cites work: Computational Complexity
cites work: Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Enhancements of trapdoor permutations
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: On Black-Box Separations among Injective One-Way Functions
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q5750403
cites work: How to use indistinguishability obfuscation
description: scientific article; zbMATH DE number 6992102