Universally Composable Adaptive Priced Oblivious Transfer
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Advances in Cryptology – CRYPTO 2004
- Alternative Protocols for Generalized Oblivious Transfer
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Compact E-Cash
- Compact E-Cash and Simulatable VRFs Revisited
- Conditional Oblivious Transfer and Timed-Release Encryption
- Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Protocols for Set Membership and Range Proofs
- Foundations of Cryptography
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- scientific article; zbMATH DE number 1670843 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 1952770 (Why is no real title available?)
- scientific article; zbMATH DE number 1418318 (Why is no real title available?)
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- P-signatures and Noninteractive Anonymous Credentials
- Simulatable Adaptive Oblivious Transfer
- Strong Conditional Oblivious Transfer and Computing on Intervals
- The Knowledge Complexity of Interactive Proof Systems
- Universally Composable Adaptive Oblivious Transfer
Cited in
(12)- UC priced oblivious transfer with purchase statistics and dynamic pricing
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- New Techniques for Non-interactive Shuffle and Range Arguments
- Adaptive oblivious transfer and generalization
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Optimistic fair priced oblivious transfer
- UC Updatable Databases and Applications
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Universally composable efficient priced oblivious transfer from a flexible membership encryption
- NIWI and new notions of extraction for algebraic languages
This page was built for publication: Universally Composable Adaptive Priced Oblivious Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392915)