General public key residue cryptosystems and mental poker protocols
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Introduction to Algorithms
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Journal of Complexity - Special issue on coding and cryptography
Simulatable Adaptive Oblivious Transfer
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Universally Composable Adaptive Oblivious Transfer
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Public-Key Cryptosystems Resilient to Key Leakage
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
On the Amortized Complexity of Zero-Knowledge Protocols
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Simple Adaptive Oblivious Transfer without Random Oracle
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficiency-improved fully simulatable adaptive OT under the DDH assumption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Practical adaptive oblivious transfer from simple assumptions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
New approach for selectively convertible undeniable signature schemes
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Simulatable adaptive oblivious transfer with statistical receiver's privacy
ProvSec'11 Proceedings of the 5th international conference on Provable security
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, DLIN (and more generally, d-linear), QR, DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic method can be further used to construct the first (memory) leakage-resilient adaptive OT.