New Algorithms for Secure Outsourcing of Modular Exponentiations

menezes, 1996, Handbook of Applied Cryptography, 10.1201/9781439821916

krawczyk, 2000, Chameleon Hashing and Signatures, Proc NDSS, 143

golle, 2001, Uncheatable Distributed Computations, Proc CT-RSA, lncs 2020, 425

10.1137/0218012

girault, 2005, Server-Aided Verification: Theory and Practice, Proc ASIACRYPT, lncs 3788, 605

10.1145/1374376.1374396

kilian, 1995, Improved Efficient Arguments (Preliminary Version), Proc Crypto, 311

kilian, 1992, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proc ACM Symp Theory Comput, 723

hohenberger, 2005, How to Securely Outsource Cryptographic Computations, Proc TCC, lncs 3378, 264

garay, 2003, Strengthening Zero-Knowledge Protocols using Signatures, Proc EUROCRYPT, lncs 2656, 177

green, 2011, Outsourcing the Decryption of ABE Ciphertexts, Proc 20th USENIX Conf Secur

0

gennaro, 2010, Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, Proc Crypto, lncs 6223, 465

10.1145/28395.28417

atallah, 2010, Securely Outsourcing Linear Algebra Computations, Proc 5th ACM Symp Inf Comput Commun Secur, 48

10.1137/S0097539702403773

10.1109/SECON.2010.5508202

carbunar, 2008, Conditioal Payments for Computing Markets, Proc CANS, lncs 5339, 317

10.1007/978-3-540-72738-5_2

chen, 2004, Chameleon Hashing without Key Exposure, Proc ISCAS, lncs 3225, 87

chevallier-mames, 2010, Secure Delegation of Elliptic-Curve Pairing, Proc CARDIS, lncs 6035, 24

chen, 2012, New Algorithms for Secure Outsourcing of Modular Exponentiations, Proc ESORICS, lncs 7459, 541

10.1109/TPDS.2011.282

wu, 2008, Server-Aided Verification Signatures: Definitions and New Constructions, Proc ProvSec, lncs 5324, 141

10.1007/s001459900017

10.1145/62212.62223

10.1109/SFCS.1994.365746

benabbas, 2011, Verifiable Delegation of Computation Over Large Datasets, Proc Crypto, lncs 6841, 111

blanton, 2012, Secure and Efficient Outsourcing of Sequence Comparisons, Proc ESORICS, lncs 7459, 505

blum, 1991, Program Result Checking Against Adaptive Programs and in Cryptographic Settings, Proc DIMACS Series Discrete Math Theoretical Comput Sci, 107

10.1016/0022-0000(93)90044-W

boyko, 1998, Speeding Up Discrete Log and Factoring Based Schemes via Precomputations, Proc EUROCRYPT, lncs 1403, 221

chaum, 1989, Undeniable Signatures, Proc Crypto, lncs 435, 212

10.1007/3-540-48071-4_7

10.1145/2046707.2046759

10.1007/s10207-005-0070-3

10.1016/S0065-2458(01)80019-X

10.1007/978-3-540-30598-9_12

ateniese, 2004, Identity-Based Chameleon Hash and Applications, Proc FC, lncs 3110, 164

10.1109/PST.2008.12

10.1007/978-3-540-68914-0_12

10.1109/INFCOM.2011.5935305

10.1016/0022-0000(88)90005-0

10.1007/BF00196725

10.1109/MIC.2012.14

shamir, 2001, Improved Online/Offline Signature Schemes, Proc Crypto, lncs 2139, 355

shi, 2007, Conditional E-Cash, Proc FC, lncs 4886, 15

nguyen, 1999, Distribution of Modular Sums and the Security of Server Aided Exponentiation, Proc Workshop Comput Number Theory Crypt, 1

matsumoto, 1988, Speeding up Secret Computations with Insecure Auxiliary Devices, Proc Crypto, lncs 403, 497

pedersen, 1992, Non-Interactive and Information-Theoretical Secure Verifiable Secret Sharing, Proc Crypto, lncs 576, 129

parno, 2012, How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption, Proc TCC, lncs 7194, 422