scientific article; zbMATH DE number 1088228
From MaRDI portal
Publication:4364544
zbMath0882.94019MaRDI QIDQ4364544
Ran Canetti, Cynthia Dwork, Rafail Ostrovsky, Moni Naor
Publication date: 17 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Deniable fully homomorphic encryption from learning with errors ⋮ Privacy-preserving file sharing on cloud storage with certificateless signcryption ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Incompressible cryptography ⋮ Anamorphic encryption: private communication against a dictator ⋮ A new framework for deniable secure key exchange ⋮ Explainable arguments ⋮ Selective Opening Security from Simulatable Data Encapsulation ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Traceable receipt-free encryption ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Subverting deniability ⋮ On elliptic curve $L$-functions integrated encryption scheme ⋮ No-Key Protocol for Deniable Encryption ⋮ Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering ⋮ Disappearing cryptography in the bounded storage model ⋮ Possibility and impossibility results for selective decommitments ⋮ A Plausibly Deniable Encryption Scheme Utilizing PUF’s Thermo-Sensitivity ⋮ Constraining Pseudorandom Functions Privately ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Standard Security Does Imply Security Against Selective Opening for Markov Distributions ⋮ Deniable searchable symmetric encryption ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ On selective-opening security of deterministic primitives ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys ⋮ Leakage resilience from program obfuscation ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
This page was built for publication:
