scientific article; zbMATH DE number 1256784
From MaRDI portal
Publication:4228521
zbMath0922.68048MaRDI QIDQ4228521
Oded Goldreich, Ran Canetti, Moni Naor, Uriel Feige
Publication date: 1 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Two-round adaptively secure multiparty computation from standard assumptions, How to Compute in the Presence of Leakage, Verifiable Range Query Processing for Cloud Computing, Receiver Selective Opening Security from Indistinguishability Obfuscation, Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts, Deniable Attribute Based Encryption for Branching Programs from LWE, Secure multi-party computation in large networks, Adaptively secure computation for RAM programs, Dynamic collusion bounded functional encryption from identity-based encryption, A query privacy-enhanced and secure search scheme over encrypted data in cloud computing, Optimal resilient threshold GQ signatures, Selective Opening Security from Simulatable Data Encapsulation, Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions, Let attackers program ideal models: modularity and composability for adaptive compromise, New and improved constructions for partially equivocable public key encryption, Anonymous public key encryption under corruptions, Multikey Fully Homomorphic Encryption and Applications, Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Completeness theorems for adaptively secure broadcast, Fully adaptive Schnorr threshold signatures, Publicly-verifiable deletion via target-collapsing functions, Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting, Non-committing encryption with constant ciphertext expansion from standard assumptions, Learning under \(p\)-tampering poisoning attacks, Adaptive security of multi-party protocols, revisited, The cost of adaptivity in security games on graphs, Concurrent composition of differential privacy, Cryptographic shallots: a formal treatment of repliable onion encryption, Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks, Possibility and impossibility results for selective decommitments, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, Blind Identity-Based Encryption and Simulatable Oblivious Transfer, Cryptography and cryptographic protocols, Secure Outsourced Computation, A full proof of the BGW protocol for perfectly secure multiparty computation, Efficient one-sided adaptively secure computation, Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption, Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited, On the Connection between Leakage Tolerance and Adaptive Security, Leakage-resilient coin tossing, Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Removing Erasures with Explainable Hash Proof Systems, New bounds for randomized busing, Simple and generic constructions of succinct functional encryption, Standard Security Does Imply Security Against Selective Opening for Markov Distributions, Adaptive Security with Quasi-Optimal Rate, On expected constant-round protocols for Byzantine agreement, Key Insulation and Intrusion Resilience over a Public Channel, Adaptively Secure Two-Party Computation with Erasures, Cryptography in the multi-string model, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Compact designated verifier NIZKs from the CDH assumption without pairings, Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited, Adaptively secure MPC with sublinear communication complexity, Tightly-secure authenticated key exchange, revisited, Compact, efficient and UC-secure isogeny-based oblivious transfer, On selective-opening security of deterministic primitives, Leakage-Resilient Coin Tossing, On Adaptively Secure Multiparty Computation with a Short CRS, On black-box complexity of universally composable security in the CRS model, A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case, New approaches for deniable authentication, Handling adaptive compromise for practical encryption schemes, Fully deniable interactive encryption, Reverse firewalls for actively secure MPCs, An efficient protocol for anonymous multicast and reception., Adaptively secure distributed public-key systems., On privacy and partition arguments, How to Simulate It – A Tutorial on the Simulation Proof Technique, Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
