A Framework for Efficient and Composable Oblivious Transfer
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Lattice-based key exchange on small integer solution problem
- Two-round MPC: information-theoretic and black-box
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-message statistically sender-private OT from LWE
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- An improved affine equivalence algorithm for random permutations
- Optimal forgeries against polynomial-based MACs and GCM
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- STP-LWE: A variant of learning with error for a flexible encryption
- All-but-many encryption
- Secure two-party computation via cut-and-choose oblivious transfer
- Bonsai trees, or how to delegate a lattice basis
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- What security can we achieve within 4 rounds?
- A framework for cryptographic problems from linear algebra
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Blazing fast OT for three-round UC OT extension
- Non-interactive zero knowledge from sub-exponential DDH
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Post-quantum multi-party computation
- Towards accountability in CRS generation
- BETA: biometric-enabled threshold authentication
- On publicly-accountable zero-knowledge and small shuffle arguments
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- UC-secure OT from LWE, revisited
- Succinct non-interactive secure computation
- Two-round oblivious transfer from CDH or LPN
- On the round complexity of secure quantum computation
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Counterexamples to new circular security assumptions underlying iO
- More efficient amortization of exact zero-knowledge proofs for LWE
- Everlasting UC commitments from fully malicious PUFs
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Round-optimal black-box protocol compilers
- Asymptotically quasi-optimal cryptography
- Secure multiparty computation with free branching
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Batch-OT with optimal rate
- Lattice trapdoors and IBE from middle-product LWE
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- From FE combiners to secure MPC and back
- On the complexity of collision resistant hash functions: new and old black-box separations
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- A framework for universally composable oblivious transfer from one-round key-exchange
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Security against covert adversaries: Efficient protocols for realistic adversaries
- On black-box complexity of universally composable security in the CRS model
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Secure linear system computation in the presence of malicious adversaries
- Survey of information security
- Fully leakage-resilient signatures
- More efficient oblivious transfer extensions
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- On the exact round complexity of best-of-both-worlds multi-party computation
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Cryptographic group actions and applications
- Succinct LWE sampling, random polynomials, and obfuscation
- Oblivious transfer from trapdoor permutations in minimal rounds
- Amortizing rate-1 OT and applications to PIR and PSI
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Finding shortest lattice vectors in the presence of gaps
- Generic construction of UC-secure oblivious transfer
- Indistinguishability obfuscation: from approximate to exact
- On the complexity of additively homomorphic UC commitments
- What Security Can We Achieve Within 4 Rounds?
- Network oblivious transfer
- Rate-1, linear time and additively homomorphic UC commitments
- Fine-Grained Cryptography
- Polly cracker, revisited
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- The simplest protocol for oblivious transfer
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Generalizing efficient multiparty computation
- Weakening the isolation assumption of tamper-proof hardware tokens
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Adaptive oblivious transfer and generalization
- Structure-preserving smooth projective hashing
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Fully simulatable quantum-secure coin-flipping and applications
- New Algorithms for Learning in Presence of Errors
- Better key sizes (and attacks) for LWE-based encryption
- The geometry of lattice cryptography
- General construction of chameleon all-but-one trapdoor functions
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- 3-message zero knowledge against human ignorance
- Approximate-deterministic public key encryption from hard learning problems
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Secure statistical analysis using RLWE-based homomorphic encryption
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
This page was built for publication: A Framework for Efficient and Composable Oblivious Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600240)
