scientific article
From MaRDI portal
Publication:3325625
zbMath0538.94011MaRDI QIDQ3325625
Shimon Even, Abraham Lempel, Oded Goldreich
Publication date: 1983
Full work available at URL: http://portal.acm.org/ft_gateway.cfm?id=3818&type=pdf&coll=GUIDE&dl=GUIDE&CFID=17809134&CFTOKEN=30689070
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptographic protocolsoblivious transfercertified electronic mailflipping a coin.public key cryptosystem applicationsrandomized protocol for signing contractssigning contracts
Related Items
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment, Computational hardness of optimal fair computation: beyond Minicrypt, Twot-out-of-n oblivious transfer schemes with designated receiver, Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations, Privacy-preserving inverse distance weighted interpolation, Partitioned encryption and achieving simultaneity by partitioning, SoK: communication across distributed ledgers, A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer, Practical and provably secure release of a secret and exchange of signatures, Enhancements of trapdoor permutations, Mathematical problems in cryptology, An improved non-repudiation protocol and its security analysis, Modular verification of protocol equivalence in the presence of randomness, Batch-OT with optimal rate, A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement, Private set intersection: new generic constructions and feasibility results, More efficient oblivious transfer extensions, Completeness for symmetric two-party functionalities: revisited, On the feasibility of extending oblivious transfer, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Algebraic restriction codes and their applications, Round-optimal oblivious transfer and MPC from computational CSIDH, Secure collaborative supply chain planning and inverse optimization -- the JELS model, Quantum public-key encryption schemes based on conjugate coding, Privacy-enhanced attribute-based private information retrieval, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Statistically sender-private OT from LPN and derandomization, Generalized oblivious transfer by secret sharing, A new framework for quantum oblivious transfer, Best of both worlds. Revisiting the spymasters double agent problem, Efficient and round-optimal oblivious transfer and commitment with adaptive security, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Quantum cryptography beyond quantum key distribution, On actively-secure elementary MPC reductions, Flexible quantum oblivious transfer, On communication models and best-achievable security in two-round MPC, Oblivious transfer from trapdoor permutations in minimal rounds, Amortizing rate-1 OT and applications to PIR and PSI, Communication-efficient distributed oblivious transfer, Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection, Blind Identity-Based Encryption and Simulatable Oblivious Transfer, Cryptography and cryptographic protocols, Concurrent signature without random oracles, Secret-Sharing Schemes: A Survey, Quantum oblivious transfer with relaxed constraints on the receiver, Quantum oblivious transfer: a secure practical implementation, Optimal symmetric ternary quantum encryption schemes, Formal Abstractions for Attested Execution Secure Processors, Fair and optimistic contract signing based on quantum cryptography, Quantum cryptography, Optimal Reductions Between Oblivious Transfers Using Interactive Hashing, Oblivious Transfer Is Symmetric, Information-Theoretic Conditions for Two-Party Secure Function Evaluation, Universally Composable Adaptive Oblivious Transfer, Alternative Protocols for Generalized Oblivious Transfer, Simple and generic constructions of succinct functional encryption, Efficient and secure outsourced approximate pattern matching protocol, Adaptively Secure Two-Party Computation with Erasures, Key-dependent message security: generic amplification and completeness, Private multiparty sampling and approximation of vector combinations, Accelerating Oblivious Transfer with Batch Multi-exponentiation, Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art, Strengthening the Security of Distributed Oblivious Transfer, Analyzing security protocols using time-bounded task-PIOAs, Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Weak Oblivious Transfer from Strong One-Way Functions, Secure multi-party quantum private information query, High-Precision Secure Computation of Satellite Collision Probabilities, What Security Can We Achieve Within 4 Rounds?, Network Oblivious Transfer, On the Power of Secure Two-Party Computation, On black-box complexity of universally composable security in the CRS model, Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction, Oblivious keyword search, On Complete Primitives for Fairness, Founding Cryptography on Tamper-Proof Hardware Tokens, Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens, Public-Key Cryptographic Primitives Provably as Secure as Subset Sum, Protecting data privacy in private information retrieval schemes, ``The simplest protocol for oblivious transfer revisited, Oblivious Transfer Based on the McEliece Assumptions, Round Optimal Universally Composable Oblivious Transfer Protocols, Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Efficient and tight oblivious transfer from PKE with tight multi-user security, An efficient protocol for secure two-party computation in the presence of malicious adversaries, Practical quantum contract signing without quantum storage, A Simple Protocol for Signing Contracts, Reducibility Among Protocols, How to Simulate It – A Tutorial on the Simulation Proof Technique, Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol, Breaking the Sub-Exponential Barrier in Obfustopia, Secure quantum weak oblivious transfer against individual measurements
