fmouhart/thesis
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
9a1d9db1b7
thesis/these.bib

2633 lines
88 KiB
BibTeX
Raw Blame History

% Encoding: windows-1252
@InCollection{BCKL08,
author = {Belenkiy, Mira and Chase, Melissa and Kohlweiss, Markulf and Lysyanskaya, Anna},
title = {P-signatures and Noninteractive Anonymous Credentials},
booktitle = {{TCC 2008}},
publisher = {Springer},
year = {2008},
number = {4948},
series = {LNCS},
timestamp = {2015.09.26},
}
@InCollection{CL04,
author = {Camenisch, Jan and Lysyanskaya, Anna},
title = {Signature Schemes and Anonymous Credentials from Bilinear Maps},
booktitle = {{CRYPTO} 2004},
publisher = {Springer},
year = {2004},
number = {3152},
series = {LNCS},
pages = {56--72},
timestamp = {2015.09.26},
}
@InCollection{CL02,
author = {Camenisch, Jan and Lysyanskaya, Anna},
title = {A Signature Scheme with Efficient Protocols},
booktitle = {{SCN} 2002},
publisher = {Springer},
year = {2002},
number = {2576},
series = {LNCS},
pages = {268--289},
timestamp = {2015.09.26},
}
@InCollection{CS97,
author = {Camenisch, Jan and Stadler, Markus},
title = {Efficient group signature schemes for large groups},
booktitle = {{Crypto} 1997},
publisher = {Springer},
year = {1997},
}
@InProceedings{CS99,
author = {Cramer, R. and Shoup, V.},
title = {Signature Schemes Based On the Strong RSA Assumption},
booktitle = {{ACM-CCS} 1999},
year = {1999},
publisher = {ACM},
timestamp = {2016.02.02},
}
@InProceedings{FO97,
author = {Fujisaki, E. and Okamoto, T.},
title = {Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations},
booktitle = {{Crypto}},
year = {1997},
volume = {1294},
series = {LNCS},
publisher = {Springer},
timestamp = {2016.02.02},
}
@Misc{Inu12,
author = {Inutile, Club},
title = {The Password Security Checker},
howpublished = {Website, available at {\url{http://inutile.club/estatis/password-security-checker/}}},
year = {2012},
}
@InCollection{LNW15,
author = {Ling, San and Nguyen, Khoa and Wang, Huaxiong},
title = {Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based},
booktitle = {{PKC} 2015},
publisher = {Springer},
year = {2015},
volume = {9020},
series = {LNCS},
pages = {427--449},
url = {http://dx.doi.org/10.1007/978-3-662-46447-2_19},
}
@InProceedings{Lyu12,
author = {Lyubashevsky, V.},
title = {Lattice Signatures Without Trapdoors},
booktitle = {{Eurocrypt} 2012},
year = {2012},
volume = {7237},
series = {LNCS},
publisher = {Springer},
timestamp = {2016.02.01},
}
@InProceedings{PSTY13,
author = {Charalampos Papamanthou and Elaine Shi and Roberto Tamassia and Ke Yi},
title = {Streaming Authenticated Data Structures},
booktitle = {{Eurocrypt} 2013},
year = {2013},
volume = {7881},
series = {LNCS},
pages = {353--370},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.03},
}
@Misc{Pei15,
author = {Peikert, Chris},
title = {A Decade of Lattice Cryptography},
howpublished = {Cryptology ePrint Archive: Report 2015/939},
month = sep,
year = {2015},
timestamp = {2015.10.06},
}
@InCollection{SSE+12,
author = {Sakai, Y. and Schuldt, J. and Emura, K. and Hanaoka, G. and Ohta, K.},
title = {On the Security of Dynamic Group Signatures: Preventing Signature Hijacking},
booktitle = {{PKC} 2012},
publisher = {Springer},
year = {2012},
volume = {7293},
series = {LNCS},
pages = {715--732},
timestamp = {2015.10.01},
}
@InProceedings{ACDN13,
author = {Abe, Masayuki and Camenisch, Jan and Dubovitskaya, Maria and Nishimaki, Ryo},
title = {Universally composable adaptive oblivious transfer (with access control) from standard assumptions},
booktitle = {ACM Workshop on Digital Identity Management},
year = {2013},
pages = {1--12},
doi = {10.1145/2517881.2517883},
}
@InProceedings{AIR01,
author = {William Aiello and Yuval Ishai and Omer Reingold},
title = {Priced oblivious transfer: How to sell digital goods},
booktitle = {Eurocrypt},
year = {2001},
pages = {119--135},
}
@InProceedings{AKPW13,
author = {Alwen, Jo\"el and Krenn, Stephan and Pietrzak, Krzysztof and Wichs, Daniel},
title = {Learning with Rounding Revisited -- New Reduction, Properties and Applications},
booktitle = {{Crypto}},
year = {2013},
volume = {8042},
series = {LNCS},
pages = {57--74},
organization = {Springer},
timestamp = {2016.01.12},
}
@InProceedings{AWSM07,
author = {Man Ho Au and Qianhong Wu and Willy Susilo and Yi Mu},
title = {Compact E-Cash from Bounded Accumulator},
booktitle = {{CT-RSA}'07},
year = {2007},
number = {4377},
series = {LNCS},
pages = {178--195},
owner = {Benoit},
timestamp = {2015.10.05},
}
@Misc{Ban15,
author = {Banerjee, A.},
title = {New Constructions of Cryptographic Pseudo-Random Functions},
howpublished = {PhD thesis, Georgia Institute of Technology},
month = aug,
year = {2015},
timestamp = {2016.01.30},
}
@InProceedings{BBL+14,
author = {Banerjee, A. and Brenner, H. and Leurent, G. and Peikert, C. and Rosen, A.},
title = {SPRING: Fast Pseudorandom Functions from Rounded Ring Products},
booktitle = {{FSE} 2014},
year = {2014},
volume = {8540},
series = {LNCS},
pages = {38--57},
timestamp = {2016.02.07},
}
@InProceedings{BP14,
author = {Banerjee, Abhishek and Peikert, Chris},
title = {New and Improved Key-Homomorphic Pseudo-Random Functions},
booktitle = {{Crypto}},
year = {2014},
volume = {8616},
series = {LNCS},
pages = {353--370},
organization = {Springer},
timestamp = {2016.01.12},
}
@InProceedings{BPR12,
author = {Banerjee, Abhishek and Peikert, Chris and Rosen, Alon},
title = {Pseudo-Random Functions and Lattices},
booktitle = {{Eurocrypt} 2012},
year = {2012},
volume = {7237},
series = {LNCS},
pages = {719--737},
organization = {Springer},
owner = {Benoit},
timestamp = {2016.01.12},
}
@InProceedings{BBSU12,
author = {Barber, S. and Boyen, X. and Shi, E. and Uzun, E.},
title = {Bitter to Better : How to Make Bitcoin a Better Currency},
booktitle = {{Financial Cryptography}},
year = {2012},
volume = {7397},
series = {LNCS},
pages = {399--414},
timestamp = {2016.02.06},
}
@InProceedings{Bar86,
author = {Barrington, D.},
title = {Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1},
booktitle = {{STOC}'86},
year = {1986},
pages = {1--5},
}
@InProceedings{BCKL08a,
author = {Belenkiy, Mira and Chase, Melissa and Kohlweiss, Markulf and Lysyanskaya, Anna},
title = {P-signatures and Noninteractive Anonymous Credentials},
booktitle = {{TCC'08}},
year = {2008},
number = {4948},
series = {LNCS},
pages = {356--374},
publisher = {Springer},
timestamp = {2015.09.26},
}
@InProceedings{BCKL09,
author = {Belenkiy, Mira and Chase, Melissa and Kohlweiss, Markulf and Lysyanskaya, Anna},
title = {Compact E-Cash and Simulatable VRFs Revisited},
booktitle = {{Pairing} 2009},
year = {2009},
volume = {5671},
series = {LNCS},
pages = {114--131},
publisher = {Springer},
timestamp = {2016.01.14},
}
@InProceedings{BCG+14,
author = {Eli Ben-Sasson and Alessandro Chiesa and Christina Garman and Matthew Green and Ian Miers and Eran Tromer and Madars Virza},
title = {Zerocash: Decentralized Anonymous Payments from Bitcoin},
booktitle = {{IEEE Symposium on Security and Privacy} 2014},
year = {2014},
pages = {459--474},
owner = {Benoit},
timestamp = {2015.10.05},
}
@InProceedings{BGM+16,
author = {Bogdanov, Andrej and Guo, Siyao and Masny, Daniel and Richelson, Silas and Rosen, Alon},
title = {On the Hardness of Learning With Rounding over Small Modulus},
booktitle = {{TCC} 2016},
year = {2016},
volume = {9562},
series = {LNCS},
pages = {209--224},
timestamp = {2016.01.12},
}
@InProceedings{BGG+14,
author = {Boneh, D. and Gentry, C. and Gorbunov, S. and Halevi, S. and Nikolaenko, V. and Segev, G. and Vaikuntanathan, V. and Vinayagamurthy, D.},
title = {Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits},
booktitle = {{Eurocrypt} 2014},
year = {2014},
}
@InProceedings{BLMR13,
author = {Boneh, Dan and Lewi, Kevin and Montgomery, Hart and Raghunathan, Ananth},
title = {Key-Homomorphic PRFs and their Applications},
booktitle = {{Crypto}},
year = {2013},
volume = {8042},
series = {LNCS},
pages = {410--428},
organization = {Springer},
timestamp = {2016.01.12},
}
@InProceedings{BDPMW16,
author = {Bourse, F. and Del Pino, R. and Minelli, M. and Wee, H},
title = {{FHE} Circuit Privacy Almost for Free},
booktitle = {{Crypto}},
year = {2016},
number = {9815},
series = {LNCS},
pages = {62--89},
}
@InProceedings{BV11,
author = {Brakerski, Z. and Vaikuntanathan, V.},
title = {Efficient Fully Homomorphic Encryption from (Standard) {LWE}},
booktitle = {{FOCS 2011}},
year = {2011},
pages = {97--106},
}
@TechReport{Bra93,
author = {Brands, S.},
title = {An efficient off-line electronic cash system based on the representation problem},
institution = {Technical Report CS-R9323, CWI},
year = {1993},
owner = {Benoit},
timestamp = {2016.02.06},
}
@InProceedings{BCR87,
author = {Brassard, Gilles and Cr{\'e}peau, Claude and Robert, Jean-Marc},
title = {All-or-nothing disclosure of secrets.},
booktitle = {{Crypto}},
year = {1987},
volume = {263},
series = {LNCS},
pages = {234--238},
}
@InProceedings{CCs08,
author = {Camenisch, J. and Chaabouni, R. and shelat, a.},
title = {Efficient Protocols for Set Membership and Range Proofs},
booktitle = {{Asiacrypt} 2008},
year = {2008},
volume = {5350},
series = {LNCS},
pages = {234--252},
}
@InProceedings{CD00,
author = {Camenisch, J. and Damg{\aa}rd, I.},
title = {Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes},
booktitle = {{Asiacrypt}},
year = {2000},
volume = {1976},
series = {LNCS},
pages = {331--345},
timestamp = {2016.01.28},
}
@InProceedings{CDEN12,
author = {Camenisch, J. and Dubovitskaya, M. and Enderlein, R. and Neven, G.},
title = {Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption},
booktitle = {{SCN} 2012},
year = {2012},
volume = {7485},
series = {LNCS},
pages = {559--579},
timestamp = {2016.03.02},
}
@InProceedings{CDN09,
author = {Camenisch, J. and Dubovitskaya, M. and Neven, G.},
title = {Oblivious transfer with access control},
booktitle = {{ACM-CCS} 2009},
year = {2009},
pages = {131--140},
timestamp = {2016.03.02},
}
@InProceedings{CDNZ11,
author = {Camenisch, J. and Dubovitskaya, M. and Neven, G. and Zaverucha, G.},
title = {Oblivious Transfer with Hidden Access Control Policies},
booktitle = {{PKC}'11},
year = {2011},
volume = {6571},
series = {LNCS},
pages = {192--209},
timestamp = {2016.03.02},
}
@InProceedings{CHL05,
author = {Camenisch, Jan and Hohenberger, Susan and Lysyanskaya, Anna},
title = {Balancing Accountability and Privacy Using E-Cash},
booktitle = {{SCN} 2006},
year = {2005},
number = {4116},
series = {LNCS},
pages = {141--155},
timestamp = {2015.10.06},
}
@InProceedings{CL02a,
author = {Camenisch, Jan and Lysyanskaya, Anna},
title = {A Signature Scheme with Efficient Protocols},
booktitle = {{Security and Cryptography for Networks} (SCN'02)},
year = {2002},
number = {2576},
series = {LNCS},
pages = {268--289},
timestamp = {2015.09.26},
}
@InProceedings{CL04a,
author = {Camenisch, Jan and Lysyanskaya, Anna},
title = {Signature Schemes and Anonymous Credentials from Bilinear Maps},
booktitle = {{Crypto}},
year = {2004},
number = {3152},
series = {LNCS},
pages = {56--72},
timestamp = {2015.09.26},
}
@InProceedings{CLM07,
author = {Camenisch, Jan and Lysyanskaya, Anna and Meyerovich, M.},
title = {Endorsed E-Cash},
booktitle = {{IEEE Security \& Privacy } 2007},
year = {2007},
pages = {101--115},
timestamp = {2015.10.06},
}
@InProceedings{CNs07,
author = {Camenisch, J. and Neven, G. and shelat, a.},
title = {Simulatable Adaptive Oblivious Transfer},
booktitle = {{Eurocrypt} 2007},
year = {2007},
volume = {4515},
series = {LNCS},
pages = {573--590},
timestamp = {2016.03.02},
}
@InProceedings{CS97a,
author = {Camenisch, Jan and Stadler, Markus},
title = {Efficient group signature schemes for large groups},
booktitle = {CRYPTO'97},
year = {1997},
pages = {410--424},
}
@InProceedings{CG07,
author = {Canard, S. and Gouget, A.},
title = {Divisible E-Cash Systems Can Be Truly Anonymous},
booktitle = {{Eurocrypt}},
year = {2007},
volume = {4515},
series = {LNCS},
pages = {482--497},
timestamp = {2016.01.28},
}
@InProceedings{CG08a,
author = {Canard, S. and Gouget, A.},
title = {Anonymity in Transferable E-cash},
booktitle = {{ACNS}},
year = {2008},
volume = {5037},
series = {LNCS},
pages = {207--223},
timestamp = {2016.02.06},
}
@InProceedings{CG10,
author = {Canard, S. and Gouget, A.},
title = {Multiple Denominations in E-cash with Compact Transaction Data},
booktitle = {{Financial Cryptography}},
year = {2010},
volume = {6052},
series = {LNCS},
pages = {82--97},
timestamp = {2016.01.28},
}
@InProceedings{CGT08,
author = {Canard, S. and Gouget, A. and Traor\'e, J.},
title = {Improvement of Efficiency in (Unconditional) Anonymous Transferable E-Cash},
booktitle = {{Financial Cryptography}},
year = {2008},
volume = {5143},
series = {LNCS},
pages = {202--214},
timestamp = {2016.02.06},
}
@InProceedings{CPST15,
author = {Canard, S. and Pointcheval, D. and Sanders, O. and Traor\'e, J.},
title = {Divisible E-Cash Made Practical},
booktitle = {{PKC}},
year = {2015},
volume = {9020},
series = {LNCS},
pages = {77--100},
timestamp = {2016.01.28},
}
@InProceedings{CPST15a,
author = {Canard, S. and Pointcheval, D. and Sanders, O. and Traor\'e, J.},
title = {Scalable Divisible E-cash},
booktitle = {{ACNS}},
year = {2015},
volume = {9092},
series = {LNCS},
pages = {287--306},
timestamp = {2016.01.28},
}
@Article{Can00,
author = {Canetti, Ran},
title = {Security and composition of multi-party cryptographic protocols},
year = {2000},
volume = {13},
number = {1},
pages = {143--202},
journaltitle = {Journal of Cryptology},
}
@InProceedings{Can01,
author = {Canetti, R.},
title = {Universally Composable Security: A New Paradigm for Cryptographic Protocols},
booktitle = {{FOCS}},
year = {2001},
pages = {136--145},
}
@InProceedings{CFT98,
author = {Chan, A. and Frankel, Y. and Tsiounis, Y.},
title = {Easy come, easy go divisible cash},
booktitle = {{Eurocrypt} 1998},
year = {1998},
volume = {1403},
series = {LNCS},
pages = {561--575},
publisher = {Springer},
timestamp = {2016.02.06},
}
@InProceedings{Cha82,
author = {Chaum, D.},
title = {Blind Signatures for Untraceable Payments},
booktitle = {{Crypto}},
year = {1982},
series = {LNCS},
pages = {199--203},
timestamp = {2016.01.28},
}
@InProceedings{Cha83,
author = {Chaum, D.},
title = {Blind Signature System},
booktitle = {{Crypto}},
year = {1983},
series = {LNCS},
pages = {153},
timestamp = {2016.02.06},
}
@InProceedings{Cha89,
author = {Chaum, D.},
title = {On-line Cash Checks},
booktitle = {{Eurocrypt} 1989},
year = {1989},
volume = {434},
series = {LNCS},
pages = {2893293},
timestamp = {2016.02.06},
}
@InProceedings{CFN88,
author = {Chaum, D. and Fiat, A. and Naor, M.},
title = {Untraceable electronic cash},
booktitle = {{Crypto}},
year = {1988},
volume = {403},
series = {LNCS},
pages = {319--327},
timestamp = {2016.01.28},
}
@InProceedings{CP92,
author = {Chaum, D. and Pedersen, T.},
title = {Transferred Cash Grows in Size},
booktitle = {{Eurocrypt}},
year = {1992},
volume = {658},
series = {LNCS},
pages = {390--407},
timestamp = {2016.01.28},
}
@InProceedings{CGKS95,
author = {Chor, B. and Goldreich, O. and Kushilevitz, E. and Sudan, M.},
title = {Private Information Retrieval},
booktitle = {{FOCS} 1995},
year = {1995},
pages = {41--50},
}
@InProceedings{Chu05,
author = {Chu, C.-K. ad Tzeng, W.-G.},
title = {Efficient k-out-of-n Oblivious Transfer Schemes With Adaptive and Non-Adaptive Queries},
booktitle = {{PKC} 2005},
year = {2005},
number = {3386},
series = {LNCS},
pages = {172--183},
}
@InProceedings{CGH09,
author = {Coull, S. and Green, M. and Hohenberger, S.},
title = {Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials},
booktitle = {{PKC} 2009},
year = {2009},
number = {5443},
series = {LNCS},
}
@InProceedings{CD09,
author = {Cramer, Ronald and Damg{\aa}rd, Ivan},
title = {On the Amortized Complexity of Zero-Knowledge Protocols},
booktitle = {{Crypto}},
year = {2009},
volume = {5677},
series = {LNCS},
pages = {177--191},
__markedentry = {[fmouhart:]},
timestamp = {2016.01.12},
}
@InProceedings{CK88,
author = {Cr{\'e}peau, Claude and Kilian, Joe},
title = {Weakening security assumptions and Oblivious Transfer},
booktitle = {Crypto},
year = {1988},
pages = {2--7},
}
@InProceedings{DDC94,
author = {D'Amiano, S. and Di Crescenzo, G.},
title = {Methodology for Digital Money based on General Cryptographic Tools},
booktitle = {{Eurocrypt} 1994},
year = {1994},
volume = {950},
series = {LNCS},
pages = {156--170},
timestamp = {2016.02.06},
}
@InProceedings{DN03,
author = {Damg{\aa}rd, I. and Nielsen, J.-B.},
title = {Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption},
booktitle = {{Crypto}},
year = {2003},
number = {2729},
series = {LNCS},
pages = {247--264},
}
@InProceedings{DCOR99,
author = {Di Crescenzo, G. and Ostrovsky, R. and Rajagopalan, S.},
title = {Conditional oblivious transfer and timed-release encryption},
booktitle = {{Eurocrypt}'99},
year = {1999},
number = {1592},
series = {LNCS},
pages = {74--89},
}
@InProceedings{Dod03,
author = {Dodis, Y.},
title = {Efficient Construction of (Distributed) Verifiable Random Functions},
booktitle = {{PKC}},
year = {2003},
volume = {2567},
series = {LNCS},
pages = {1--17},
timestamp = {2016.01.28},
}
@InProceedings{DY05,
author = {Dodis, Y. and Yampolskiy, A.},
title = {A Verifiable Random Function with Short Proofs and Keys},
booktitle = {{PKC} 2005},
year = {2005},
number = {3386},
series = {LNCS},
pages = {416--431},
timestamp = {2015.10.06},
}
@InProceedings{DFKS16,
author = {D\"ottling, N. and Fleischhacker, N. and Krupp, J. and Schr\"oder, D.},
title = {Two-Message, Oblivious Evaluation of Cryptographic Functionalities},
booktitle = {{Crypto} 2016},
year = {2016},
number = {9816},
series = {LNCS},
pages = {619--648},
}
@InProceedings{DS15,
author = {D\"ottling, N. and Schr\"oder, D.},
title = {Efficient Pseudorandom Functions via On-the-Fly Adaptation},
booktitle = {{Crypto} 2015},
year = {2015},
volume = {9215},
series = {LNCS},
pages = {329--350},
timestamp = {2016.02.07},
}
@InProceedings{DS16,
author = {Ducas, L. and Stehl\'e, D.},
title = {Sanitization of {FHE} Ciphertexts},
booktitle = {{Eurocrypt} 2016},
year = {2016},
series = {LNCS},
note = {Cryptology ePrint Archive: Report 2016/164},
timestamp = {2016.03.01},
}
@Article{EGL85,
author = {Even, S. and Goldreich, O. and Lempel, A.},
title = {A Randomized Protocol for Signing Contracts},
year = {1985},
volume = {28},
number = {6},
pages = {637--647},
journaltitle = {Communications of the {ACM}},
timestamp = {2016.03.02},
}
@InProceedings{FTY96,
author = {Frankel, Y. and Tsiounis, Y. and Yung, M.},
title = {"Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash},
booktitle = {{Asiacrypt}},
year = {1996},
volume = {1163},
series = {LNCS},
pages = {286--300},
publisher = {Springer},
timestamp = {2016.01.28},
}
@InProceedings{FY93,
author = {Franklin, M. and Yung, M.},
title = {Secure and Efficient Off-Line Digital Money},
booktitle = {{ICALP}},
year = {1993},
volume = {700},
series = {LNCS},
pages = {265--276},
publisher = {Springer},
timestamp = {2016.01.28},
}
@InProceedings{FIPR05,
author = {Freedman, M. and Ishai, Y. and Pinkas, B. and Reingold, O.},
title = {Keyword Search and Oblivious Pseudorandom Functions},
booktitle = {{TCC} 2005},
year = {2005},
volume = {3378},
series = {LNCS},
pages = {303--324},
timestamp = {2016.02.05},
}
@InProceedings{FPV09,
author = {Fuchsbauer, G. and Pointcheval, D. and Vergnaud, D.},
title = {Transferable Constant-Size Fair E-Cash},
booktitle = {{CANS} 2009},
year = {2009},
volume = {5888},
series = {LNCS},
pages = {226--247},
timestamp = {2016.02.06},
}
@InProceedings{GSW13,
author = {Gentry, C. and Sahai, A. and Waters, B.},
title = {Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based},
booktitle = {{Crypto}},
year = {2013},
number = {8042},
series = {LNCS},
pages = {75--92},
}
@InProceedings{GGM86,
author = {Goldreich, O. and Goldwasser, S. and Micali, S.},
title = {How to construct random functions},
booktitle = {J. of {ACM}},
year = {1986},
volume = {33},
number = {4},
pages = {792--807},
timestamp = {2016.01.30},
}
@InProceedings{GMW87,
author = {Goldreich, Oded and Micali, Silvio and Wigderson, Avi},
title = {How to play any mental game or a completeness theorem for protocols with honest majority},
booktitle = {STOC},
year = {1987},
pages = {218--229},
}
@InProceedings{GV15,
author = {Gorbunov, S. and Vinayagamurthy, D.},
title = {Riding on Asymmetry: Efficient ABE for Branching Programs},
booktitle = {{Asiacrypt} 2015},
year = {2015},
}
@InProceedings{GH07,
author = {Green, M. and Hohenberger, S.},
title = {Blind Identity-Based Encryption and Simulatable Oblivious Transfer},
booktitle = {{Asiacrypt} 2007},
year = {2007},
volume = {4833},
series = {LNCS},
pages = {265--282},
timestamp = {2016.03.02},
}
@InProceedings{GH11,
author = {Green, M. and Hohenberger, S.},
title = {Practical Adaptive Oblivious Transfer from Simple Assumptions},
booktitle = {{TCC} 2011},
year = {2011},
volume = {6597},
series = {LNCS},
pages = {347--363},
timestamp = {2016.03.02},
}
@Article{Her11,
author = {Herranz, J.},
title = {Restricted Adaptive Oblivious Transfer},
year = {2011},
volume = {412},
number = {46},
pages = {6498--6506},
journaltitle = {Theoretical Computer Science},
}
@InProceedings{HAO15,
author = {Hiromasa, R. and Abe, M. and Okamoto, T.},
title = {Packing Messages and Optimizing Bootstrapping in {GSW-FHE}},
booktitle = {{PKC} 2015},
year = {2015},
number = {9020},
series = {LNCS},
pages = {699--715},
chapter = {Hiromasa, R. and Abe, M. and Okamoto, T.},
}
@Misc{Inu12a,
author = {Inutile, Club},
title = {The Password Security Checker},
howpublished = {Website, available at {\url{http://inutile.club/estatis/password-security-checker/}}},
year = {2012},
}
@InProceedings{IP07,
author = {Yuval Ishai and Anat Paskin},
title = {Evaluating Branching Programs on Encrypted Data},
booktitle = {{TCC} 2007},
year = {2007},
}
@InProceedings{JL09,
author = {Jarecki, S. and Liu, X.},
title = {Efficient Oblivious Pseudorandom Function with Applications to Adaptive {OT} and Secure Computation of Set Intersection},
booktitle = {{TCC} 2009},
year = {2009},
volume = {5444},
series = {LNCS},
pages = {577--594},
timestamp = {2016.02.05},
}
@InProceedings{JS07,
author = {Jarecki, S. and Shmatikov, V.},
title = {Efficient Two-Party Secure Computation on Committed Inputs},
booktitle = {{Eurocrypt} 2007},
year = {2007},
volume = {4515},
series = {LNCS},
pages = {97--114},
timestamp = {2016.02.05},
}
@InProceedings{Kil88,
author = {Kilian, J.},
title = {Founding Cryptography on Oblivious Transfer},
booktitle = {{STOC} 1988},
year = {1988},
timestamp = {2016.03.02},
}
@InProceedings{KP06,
author = {Kunz-Jacques, S{\'{e}}bastien and Pointcheval, David},
title = {About the security of {MTI/C0} and {MQV}},
booktitle = {SCN'06},
year = {2006},
editor = {Springer},
pages = {156--172},
}
@InProceedings{KN09,
author = {Kurosawa, K. and Nojima, R.},
title = {Simple Adaptive Oblivious Transfer Without Random Oracle},
booktitle = {{Asiacrypt} 2009},
year = {2009},
volume = {5912},
series = {LNCS},
pages = {334--346},
timestamp = {2016.03.02},
}
@InProceedings{KPN10,
author = {Kurosawa, K. and Phong, L. and Nojima, R.},
title = {Efficiency-Improved Fully Simulatable Adaptive {OT} under the {DDH} Assumption},
booktitle = {{SCN} 2010},
year = {2010},
volume = {6280},
series = {LNCS},
pages = {172--181},
owner = {Benoit},
timestamp = {2016.03.02},
}
@InProceedings{KPN11,
author = {Kurosawa, K. and Phong, L. and Nojima, R.},
title = {Generic Fully Simulatable Adaptive Oblivious Transfer},
booktitle = {{ACNS} 2011},
year = {2011},
volume = {6715},
series = {LNCS},
pages = {274--291},
timestamp = {2016.03.02},
}
@InProceedings{LOS+10,
author = {Lewko, A. and Okamoto, T. and Sahai, A. and Takashima, K. and Waters, B.},
title = {Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption},
booktitle = {{Eurocrypt} 2010},
year = {2010},
number = {6110},
series = {LNCS},
}
@InProceedings{LLM+16,
author = {Libert, B. and Ling, S. and Mouhartem, F. and Nguyen, K. and Wang, H.},
title = {Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions},
booktitle = {{Asiacrypt} 2016},
year = {2016},
url = {http://ia.cr/2016/101},
}
@InProceedings{LLM+16a,
author = {Libert, B. and Ling, S. and Mouhartem, F. and Nguyen, K. and Wang, H.},
title = {Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption},
booktitle = {{Asiacrypt} 2016},
year = {2016},
url = {https://ia.cr/2016/879},
}
@Article{Lin08,
author = {Lindell, Andrew Y.},
title = {Efficient Fully-Simulatable Oblivious Transfer},
year = {2008},
journaltitle = {CT-RSA},
series = {LNCS},
}
@InProceedings{LNW15a,
author = {Ling, San and Nguyen, Khoa and Wang, Huaxiong},
title = {Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based},
booktitle = {PKC 2015},
year = {2015},
volume = {9020},
series = {LNCS},
pages = {427--449},
doi = {10.1007/978-3-662-46447-2_19},
isbn = {978-3-662-46446-5},
language = {English},
url = {http://dx.doi.org/10.1007/978-3-662-46447-2_19},
}
@Article{Lip08,
author = {Helger Lipmaa},
title = {Private Branching Programs: On Communication-Efficient Cryptocomputing},
year = {2008},
volume = {2008},
pages = {107},
bibsource = {dblp computer science bibliography, http://dblp.org},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/iacr/Lipmaa08},
journaltitle = {{IACR} Cryptology ePrint Archive},
timestamp = {Mon, 05 Dec 2011 18:05:42 +0100},
url = {https://ia.cr/2008/107},
}
@InProceedings{Mer89,
author = {Ralph C. Merkle},
title = {{A Certified Digital Signature}},
booktitle = {{Crypto}},
year = {1989},
}
@InProceedings{MRV99,
author = {Micali, S. and Rabin, M. and Vadhan, S.},
title = {Verifiable Random Functions},
booktitle = {FOCS 1999},
year = {1999},
pages = {120--130},
owner = {t},
timestamp = {2016.02.08},
}
@InProceedings{MS95,
author = {Micali, S. and Sidney, R.},
title = {A simple method for generating and sharing pseudo-random functions},
booktitle = {{Crypto} 1995},
year = {1995},
volume = {963},
series = {LNCS},
pages = {185196},
timestamp = {2016.02.07},
}
@InProceedings{MGGR13,
author = {Miers, I. and Garman, C. and Green, M. and Rubin, A.},
title = {Zerocoin: Anonymous Distributed E-Cash from Bitcoin},
booktitle = {{IEEE Security \& Privacy} 2013},
year = {2013},
pages = {397--411},
timestamp = {2016.02.06},
}
@InProceedings{MW16,
author = {Mukherjee, P. and Wichs, D.},
title = {Two Round Mutliparty Computation via Multi-Key FHE},
booktitle = {{Eurocrypt} 2016},
year = {2016},
series = {LNCS},
note = {To appear},
timestamp = {2016.02.06},
}
@Misc{Nak,
author = {Nakamoto, S.},
title = {Bitcoin: A peer-to-peer electronic cash system},
howpublished = {\url{www.bitcoin.org}},
owner = {Benoit},
timestamp = {2016.02.06},
}
@InProceedings{NP01,
author = {Naor, Moni and Pinkas, Benny},
title = {Efficient oblivious transfer protocols.},
booktitle = {SODA},
year = {2001},
pages = {448--457},
}
@Article{NP05,
author = {Naor, M. and Pinkas, B.},
title = {Computationally Secure Oblivious Transfer},
year = {2005},
volume = {18},
number = {1},
pages = {1--35},
journaltitle = {Journal of Cryptology},
}
@InProceedings{NP99,
author = {Naor, M. and Pinkas, B.},
title = {Oblivious transfer with adaptive queries},
booktitle = {{Crypto}},
year = {1999},
volume = {1666},
series = {LNCS},
pages = {573--590},
timestamp = {2016.03.02},
}
@InProceedings{NPR99,
author = {Naor, M. and Pinkas, B. and Reingold, O.},
title = {Distributed Pseudo-random Functions and KDCs},
booktitle = {{Eurocrypt} 1999},
year = {1999},
volume = {1592},
series = {LNCS},
pages = {327--346},
timestamp = {2016.02.07},
}
@Article{NR04,
author = {Naor, M. and Reingold, O.},
title = {Number-theoretic constructions of efficient pseudo-random functions},
year = {2004},
volume = {51},
pages = {231--262},
journaltitle = {Journal of the ACM},
timestamp = {2016.01.28},
}
@InProceedings{NYO08,
author = {Nishide, T. and Yoneyama, K. and Ohta, K.},
title = {Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures},
booktitle = {{ACNS}'08},
year = {2008},
number = {5037},
series = {LNCS},
pages = {111--129},
}
@InProceedings{OO89,
author = {Ohta, K. and Okamoto, T.},
title = {Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash},
booktitle = {{Crypto} 1989},
year = {1989},
volume = {435},
series = {LNCS},
pages = {481--496},
timestamp = {2016.01.28},
}
@InProceedings{OO91,
author = {Ohta, K. and Okamoto, T.},
title = {Universal Electronic Cash},
booktitle = {{Crypto} 1991},
year = {1991},
volume = {576},
series = {LNCS},
pages = {324--337},
publisher = {Springer},
timestamp = {2016.02.06},
}
@InProceedings{Oka95,
author = {Okamoto, T.},
title = {An Efficient Divisible Electronic Cash Scheme},
booktitle = {{Crypto} 1995},
year = {1995},
volume = {963},
series = {LNCS},
pages = {438--451},
publisher = {Springer},
timestamp = {2016.02.06},
}
@InProceedings{Pai92,
author = {Pailles, J.-C.},
title = {New Protocols for Electronic Money},
booktitle = {{Auscrypt} 1992},
year = {1992},
volume = {718},
series = {LNCS},
pages = {263--274},
publisher = {Springer},
timestamp = {2016.02.06},
}
@Misc{Pei15a,
author = {Peikert, Chris},
title = {A Decade of Lattice Cryptography},
howpublished = {Cryptology ePrint Archive: Report 2015/939},
month = sep,
year = {2015},
timestamp = {2015.10.06},
}
@InProceedings{PVW08,
author = {Peikert, C. and Vaikuntanathan, V. and Waters, B.},
title = {A Framework for Efficient and Composable Oblivious Transfer},
booktitle = {{Crypto} 2008},
year = {2008},
volume = {5157},
series = {LNCS},
pages = {554--571},
timestamp = {2016.02.06},
}
@Misc{Rab81,
author = {Rabin, M.},
title = {How to exchange secrets by oblivious transfer},
howpublished = {Technical Report TR-81, Aiken Computation Laboratory, Harvard University},
year = {1981},
timestamp = {2016.03.02},
}
@Article{Reg09,
author = {Oded Regev},
title = {{On Lattices, Learning with Errors, Random Linear Codes, and Cryptography}},
year = {2009},
volume = {56},
number = {6},
bibsource = {DBLP, http://dblp.uni-trier.de},
ee = {http://doi.acm.org/10.1145/1568318.1568324},
journaltitle = {Journal of the ACM},
timestamp = {2016.02.06},
}
@InProceedings{RKP09,
author = {Alfredo Rial and Markulf Kohlweiss and Bart Preneel},
title = {Universally composable adaptive priced oblivious transfer},
booktitle = {Pairing'09},
year = {2009},
editor = {Springer},
series = {LNCS},
pages = {231--247},
}
@InProceedings{Rue10,
author = {R\"uckert, M.},
title = {Lattice-Based Blind Signatures},
booktitle = {{Asiacrypt}},
year = {2010},
volume = {6477},
series = {LNCS},
pages = {413--430},
timestamp = {2016.02.06},
}
@InProceedings{SW05,
author = {Sahai, A. and Waters, B.},
title = {Fuzzy Identity-Based Encryption},
booktitle = {{Eurocrypt} 2005},
year = {2005},
number = {3494},
series = {LNCS},
pages = {457--473},
}
@InProceedings{SSE+12a,
author = {Sakai, Y. and Schuldt, J. and Emura, K. and Hanaoka, G. and Ohta, K.},
title = {On the Security of Dynamic Group Signatures: Preventing Signature Hijacking},
booktitle = {PKC 2012},
year = {2012},
volume = {7293},
series = {LNCS},
pages = {715--732},
edition = {Springer},
timestamp = {2015.10.01},
}
@Article{vSN92,
author = {von Solms, S. and Naccache, D.},
title = {On blind signatures and perfect crimes},
year = {1992},
volume = {11},
pages = {581583},
journaltitle = {Computers \& Security},
timestamp = {2016.02.06},
}
@InProceedings{Tau05,
author = {Tauman-Kalai, Y.},
title = {Smooth Projective Hashing and Two-Message Oblivious Transfer},
booktitle = {{Eurocrypt}'05},
year = {2005},
number = {3494},
series = {LNCS},
pages = {78--95},
publisher = {Springer},
}
@PhdThesis{Tsi97,
author = {Tsiounis, Y.},
title = {Efficient Electronic Cash: New Notions and Techniques},
year = {1997},
howpublished = {PhD thesis, Northeastern University},
institution = {Northeastern University},
timestamp = {2016.01.28},
}
@InProceedings{ZAW+10,
author = {Zhang, Y. and Au, M.-H. and Wong, D. and Huang, Q. and Mamoulis, N. and Cheung, D. and Yiu, S.-M.},
title = {Oblivious Transfer with Access Control: Realizing Disjunction without Duplication},
booktitle = {{Pairing} 2010},
year = {2010},
number = {6847},
series = {LNCS},
pages = {96--115},
}
@InProceedings{ACD+12,
author = {Masayuki Abe and Melissa Chase and Bernardo David and Markulf Kohlweiss and Ryo Nishimaki and Miyako Ohkubo},
title = {Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions},
booktitle = {{Asiacrypt} 2012},
year = {2012},
volume = {7658},
number = {7658},
series = {LNCS},
pages = {4--24},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{AFG+10,
author = {Masayuki Abe and Georg Fuchsbauer and Jens Groth and Kristiyan Haralambiev and Miyako Ohkubo},
title = {Structure-Preserving Signatures and Commitments to Group Elements},
booktitle = {{Crypto} 2010},
year = {2010},
volume = {6223},
number = {6223},
series = {LNCS},
pages = {209--236},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{ABB10,
author = {Agrawal, S. and Boneh, D. and Boyen, X.},
title = {Efficient Lattice {(H)IBE} in the Standard Model},
booktitle = {{Eurocrypt}},
year = {2010},
volume = {6110},
series = {LNCS},
pages = {553--572},
publisher = {Springer},
timestamp = {2015.06.15},
}
@InProceedings{ABB+13,
author = {Carlos Aguilar-Melchor and Slim Bettaieb and Xavier Boyen and Laurent Fousse and Philippe Gaborit},
title = {Adapting Lyubashevsky's Signature Schemes to the Ring Signature Setting},
booktitle = {{Africacrypt} 2013},
year = {2013},
volume = {7918},
series = {LNCS},
pages = {1--25},
publisher = {Springer},
owner = {Benoit},
timestamp = {2015.10.05},
}
@InProceedings{AP09,
author = {Alwen, J. and Peikert, C.},
title = {Generating shorter bases for hard random lattices},
booktitle = {{STACS} 2009},
year = {2009},
volume = {3},
series = {LNCS},
pages = {75--86},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
timestamp = {2015.08.30},
}
@InProceedings{AJL+12,
author = {Asharov, G. and Jain, A. and Lopez-Alt, A. and Tromer, E. and Vaikuntanathan, V. and Wichs, D.},
title = {Multiparty Computation with Low Communication, Computation and Interaction via Threshold {FHE}},
booktitle = {Eurocrypt 2012},
year = {2012},
volume = {7237},
series = {LNCS},
pages = {483--501},
publisher = {Springer},
timestamp = {2015.06.11},
}
@InProceedings{ACJT00,
author = {Ateniese, Giuseppe and Camenisch, Jan and Joye, Marc and Tsudik, Gene},
title = {A practical and provably secure coalition-resistant group signature scheme},
booktitle = {Crypto 2000},
year = {2000},
volume = {1880},
series = {LNCS},
pages = {255--270},
organization = {Springer},
publisher = {Springer},
}
@InProceedings{AT99,
author = {Ateniese, Giuseppe and Tsudik, Gene},
title = {Some open issues and new directions in group signatures},
booktitle = {Financial Cryptography},
year = {1999},
pages = {196--211},
organization = {Springer},
}
@Article{BHJ+15,
author = {B{\"o}hl, Florian and Hofheinz, Dennis and Jager, Tibor and Koch, Jessica and Striecks, Christoph},
title = {Confined guessing: New signatures from standard assumptions},
journal = {Journal of Cryptology},
year = {2015},
volume = {28},
number = {1},
pages = {176--208},
journaltitle = {Journal of Cryptology},
publisher = {Springer},
}
@InProceedings{BLL+15,
author = {Bai, Shi and Langlois, Adeline and Lepoint, Tancr\`ede and Stehl\'e, Damien and Steinfeld, Ron},
title = {Improved Security Proofs in Lattice-Based Cryptography: Using the {R\'enyi} Divergence Rather Than the Statistical Distance},
booktitle = {{Asiacrypt} 2015},
year = {2015},
volume = {9452},
series = {LNCS},
publisher = {Springer},
timestamp = {2015.08.29},
}
@Article{Ban93,
author = {Banaszczyk, W.},
title = {New bounds in some transference theorems in the geometry of number},
year = {1993},
volume = {296},
pages = {625--635},
eid = {Springer-Verlag},
journaltitle = {Mathematische Annalen},
timestamp = {2015.08.30},
}
@InProceedings{BP97,
author = {Niko Baric and Birgit Pfitzmann},
title = {{Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees}},
booktitle = {{Eurocrypt} 1997},
year = {1997},
volume = {1233},
series = {LNCS},
pages = {480--494},
publisher = {Springer},
owner = {Benoit},
timestamp = {2015.10.06},
}
@InProceedings{BCC+09,
author = {Mira Belenkiy and Jan Camenisch and Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya and Hovav Shacham},
title = {Randomizable Proofs and Delegatable Anonymous Credentials},
booktitle = {{Crypto} 2009},
year = {2009},
volume = {5677},
series = {LNCS},
pages = {108--125},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{BMW03,
author = {Bellare, Mihir and Micciancio, Daniele and Warinschi, Bogdan},
title = {Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions},
booktitle = {{Eurocrypt} 2003},
year = {2003},
volume = {3376},
number = {2656},
series = {LNCS},
pages = {614--629},
publisher = {Springer},
}
@InProceedings{BSZ05,
author = {Bellare, Mihir and Shi, Haixia and Zhang, Chong},
title = {Foundations of group signatures: The case of dynamic groups},
booktitle = {{CT-RSA} 2005},
year = {2005},
volume = {2656},
number = {3376},
series = {LNCS},
pages = {136--153},
publisher = {Springer},
}
@InProceedings{BCK+14,
author = {Benhamouda, Fabrice and Camenisch, Jan and Krenn, Stephan and Lyubashevsky, Vadim and Neven, Gregory},
title = {Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures},
booktitle = {{Asiacrypt} 2014},
year = {2014},
number = {8873},
series = {LNCS},
pages = {551--572},
publisher = Springer,
}
@InProceedings{BKLP15,
author = {Fabrice Benhamouda and Stephan Krenn and Vadim Lyubashevsky and Krzysztof Pietrzak},
title = {Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings},
booktitle = {{ESORICS} 2015},
year = {2015},
volume = {9326},
series = {LNCS},
pages = {305--325},
publisher = {Springer},
note = {to appear},
timestamp = {2015.10.06},
}
@Article{BKLP14,
author = {Fabrice Benhamouda and Stephan Krenn and Vadim Lyubashevsky and Krzysztof Pietrzak},
title = {{Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings}},
year = {2014},
volume = {2014},
pages = {889},
journaltitle = {{IACR} Cryptology ePrint Archive},
owner = {Benoit},
timestamp = {2015.10.06},
url = {https://ia.cr/2014/889},
}
@InProceedings{BB04,
author = {D. Boneh and X. Boyen},
title = {Efficient Selective-{ID} Secure Identity-Based Encryption Without Random Oracles},
booktitle = {{E}urocrypt},
year = {2004},
volume = {3027},
series = {LNCS},
pages = {223--238},
publisher = {Springer},
timestamp = {2012.10.16},
}
@InProceedings{BBS04,
author = {Boneh, Dan and Boyen, Xavier and Shacham, Hovav},
title = {Short group signatures},
booktitle = {{Crypto} 2004},
year = {2004},
volume = {3152},
series = {LNCS},
pages = {41--55},
organization = {Springer},
}
@InProceedings{BS04,
author = {Boneh, Dan and Shacham, Hovav},
title = {Group signatures with verifier-local revocation},
booktitle = {{ACM-CCS} 2004},
year = {2004},
pages = {168--177},
organization = {ACM},
}
@InProceedings{Boy10,
author = {Boyen, Xavier},
title = {Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more},
booktitle = {{PKC 2010}},
year = {2010},
volume = {6056},
series = {LNCS},
pages = {499--517},
publisher = {Springer},
}
@InProceedings{BW07,
author = {X. Boyen and B. Waters},
title = {Full-Domain Subgroup Hiding and Constant-Size Group Signatures},
booktitle = {{PKC} 2007},
year = {2007},
volume = {4450},
series = {LNCS},
pages = {1--15},
publisher = {Springer},
owner = {Benoit},
timestamp = {2012.10.16},
}
@InProceedings{BW06,
author = {X. Boyen and B. Waters},
title = {Compact Group Signatures Without Random Oracles},
booktitle = {{E}urocrypt},
year = {2006},
volume = {4004},
series = {LNCS},
pages = {427--444},
publisher = {Springer},
owner = {Benoit},
timestamp = {2012.10.16},
}
@Article{BK10,
author = {Zvika Brakerski and Yael Tauman Kalai},
title = {A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model},
year = {2010},
volume = {2010},
pages = {86},
bibsource = {DBLP, http://dblp.uni-trier.de},
ee = {https://ia.cr/2010/086},
journaltitle = {IACR Cryptology ePrint Archive},
owner = {Benoit},
timestamp = {2015.10.06},
}
@InProceedings{BLP+13,
author = {Brakerski, Z. and Langlois, A. and Peikert, C. and Regev, O. and Stehl{\'e}, D.},
title = {On the classical hardness of learning with errors},
booktitle = {{STOC} 2013},
year = {2013},
pages = {575--584},
publisher = {ACM},
timestamp = {2015.09.26},
}
@InProceedings{BPVY00,
author = {Brickell, E. and Pointcheval, D. and Vaudenay, S. and Yung, M.},
title = {Design Validations for Discrete Logarithm Based Signature Schemes},
booktitle = {{PKC} 2000},
year = {2000},
volume = {1751},
series = {LNCS},
pages = {276--292},
publisher = {Springer},
timestamp = {2015.06.10},
}
@InProceedings{CDHK15,
author = {Camenisch, J. and Dubovitskaya, M. and Haralambiev, K. and Kohlweiss, M.},
title = {Composable and Modular Anonymous Credentials: Definitions and Practical Constructions},
booktitle = {{Asiacrypt} 2015},
year = {2015},
series = {LNCS},
publisher = {Springer},
timestamp = {2015.09.28},
url = {https://ia.cr/2015/580},
}
@InProceedings{CG08,
author = {Camenisch, Jan and Gross, Thomas},
title = {Efficient attributes for anonymous credentials},
booktitle = {{ACM-CCS} 2008},
year = {2008},
pages = {345--356},
publisher = {ACM},
timestamp = {2015.10.06},
}
@InProceedings{CHL05a,
author = {Camenisch, Jan and Hohenberger, Susan and Lysyanskaya, Anna},
title = {Compact e-cash},
booktitle = {{Eurocrypt} 2005},
year = {2005},
number = {3494},
series = {LNCS},
pages = {302--321},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{CKY09,
author = {Camenisch, Jan and Kiayias, Aggelos and Yung, Moti},
title = {On the Portability of Generalized {Schnorr} Proofs},
booktitle = {{Eurocrypt} 2009},
year = {2009},
number = {5479},
series = {LNCS},
pages = {425--442},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{CKL+15,
author = {Camenisch, J. and Krenn, S. and Lehmann, A. and Mikkelsen, G.-L. and Neven, G. and Pedersen, M.-0.},
title = {Formal Treatment of Privacy-Enhancing Credential Systems},
booktitle = {{SAC} 2015},
year = {2015},
series = {LNCS},
pages = {3--24},
publisher = {Springer},
timestamp = {2015.09.28},
url = {https://ia.cr/2014/708},
}
@InProceedings{CL02b,
author = {Jan Camenisch and Anna Lysyanskaya},
title = {Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials},
booktitle = {{CRYPTO} 2002},
year = {2002},
volume = {2442},
series = {LNCS},
pages = {61--76},
publisher = {Springer},
owner = {Benoit},
timestamp = {2015.10.06},
}
@InProceedings{CL01,
author = {Camenisch, Jan and Lysyanskaya, Anna},
title = {An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation},
booktitle = {{Eurocrypt} 2001},
year = {2001},
number = {2045},
series = {LNCS},
pages = {93--118},
publisher = {Springer},
timestamp = {2015.09.26},
}
@InProceedings{CNR12,
author = {J. Camenisch and G. Neven and M. R{\"u}ckert},
title = {Fully Anonymous Attribute Tokens from Lattices},
booktitle = {{SCN} 2012},
year = {2012},
volume = {7485},
series = {LNCS},
pages = {57--75},
publisher = {Springer},
timestamp = {2012.10.18},
}
@InProceedings{CHKP10,
author = {Cash, D. and Hofheinz, D. and Kiltz, E. and Peikert, C.},
title = {Bonsai Trees, or How to Delegate a Lattice Basis},
booktitle = {{Eurocrypt} 2010},
year = {2010},
volume = {6110},
series = {LNCS},
pages = {523--552},
publisher = {Springer},
timestamp = {2015.08.30},
}
@InProceedings{CLY09,
author = {Julien Cathalo and Beno\^it Libert and Moti Yung},
title = {Group Encryption: Non-Interactive Realization in the Standard Model},
booktitle = {{Asiacrypt} 2009},
year = {2009},
number = {5912},
series = {LNCS},
pages = {179--196},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{CMZ14,
author = {Melissa Chase and Sarah Meiklejohn and Greg Zaverucha},
title = {Algebraic MACs and Keyed-Verification Anonymous Credentials},
booktitle = {{ACM-CCS} 2014},
year = {2014},
pages = {1205--1216},
publisher = {ACM},
timestamp = {2015.10.06},
}
@Article{Cha85,
author = {Chaum, David},
title = {Security without Identification: Transactions ssystem to make big brother obsolete},
year = {1985},
volume = {28},
number = {10},
pages = {1030--1044},
journaltitle = {Communications of the {ACM}},
timestamp = {2015.09.26},
}
@InProceedings{CVH91,
author = {Chaum, David and Van Heyst, Eug{\`e}ne},
title = {Group signatures},
booktitle = {{Eurocrypt} 1991},
year = {1991},
volume = {547},
series = {LNCS},
pages = {257--265},
organization = {Springer},
publisher = {Springer},
}
@InProceedings{CVH91a,
author = {Chaum, David and Van Heyst, Eug{\`e}ne},
title = {Group signatures},
booktitle = {{Eurocrypt} 1991},
year = {1991},
volume = {547},
series = {LNCS},
pages = {257--265},
organization = {Springer},
publisher = {Springer},
}
@InProceedings{Dam00,
author = {Damg{\aa}rd, I.},
title = {Efficient Concurrent Zero-Knowledge in the Auxiliary String Model},
booktitle = {{Eurocrypt} 2000},
year = {2000},
volume = {1807},
series = {LNCS},
pages = {418--430},
publisher = {Springer},
edition = {Springer},
timestamp = {2015.10.01},
}
@InProceedings{DHKT08,
author = {Damg{\aa}rd, I. and Hofheinz, D. and Kiltz, E. and Thorbek, R.},
title = {Public-key encryption with non-interactive opening},
booktitle = {{CT-RSA} 2008},
year = {2008},
volume = {4964},
series = {LNCS},
pages = {239--255},
publisher = {Springer},
edition = {Springer},
timestamp = {2015.10.01},
}
@InProceedings{DT07,
author = {Damg{\aa}rd, I. and Thorbek, R.},
title = {Non-interactive Proofs for Integer Multiplication},
booktitle = {{Eurocrypt} 2007},
year = {2007},
volume = {4515},
series = {LNCS},
pages = {412--429},
publisher = {Springer},
edition = {Springer},
timestamp = {2015.10.01},
}
@InProceedings{DP06,
author = {Delerabl{\'e}e, C{\'e}cile and Pointcheval, David},
title = {Dynamic fully anonymous short group signatures},
booktitle = {VietCrypt 2006},
year = {2006},
volume = {4341},
number = {4341},
series = {LNCS},
pages = {193--210},
publisher = {Springer},
}
@Article{DZ09,
author = {Delgrossi, Luca and Zhang, Tao},
title = {Dedicated Short-Range Communications},
year = {2009},
pages = {44--51},
journaltitle = {Vehicle Safety Communications: Protocols, Security, and Privacy},
publisher = {Wiley Online Library},
}
@InProceedings{ELL+15,
author = {Martianus Frederic Ezerman and Hyung Tae Lee and San Ling and Khoa Nguyen and Huaxiong Wang},
title = {A Provably Secure Group Signature Scheme from Code-Based Assumptions},
booktitle = {{Asiacrypt}'15},
year = {2015},
volume = {9452},
series = {LNCS},
pages = {260--285},
publisher = {Springer},
howpublished = {Cryptology ePrint Archive, Report 2015/479},
}
@InProceedings{FS86,
author = {Fiat, Amos and Shamir, Adi},
title = {How To Prove Yourself: Practical Solutions to Identification and Signature Problems},
booktitle = {CRYPTO},
year = {1986},
editor = {Odlyzko, Andrew M.},
pages = {186--194},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1{\%} to 4{\%} of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.},
isbn = {978-3-540-47721-1},
}
@InProceedings{GLF+10,
author = {Galindo, D. and Libert, B. and Fischlin, M. and Fuchsbauer, G. and Lehmann, A. and Manulis, M. and Schr\"oder, D.},
title = {Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions},
booktitle = {{Africacrypt} 2010},
year = {2010},
volume = {6055},
series = {LNCS},
pages = {333--350},
publisher = {Springer},
edition = Springer,
timestamp = {2015.10.01},
}
@InProceedings{Gen09,
author = {Gentry, C.},
title = {Fully homomorphic encryption using ideal lattices},
booktitle = {{STOC} 2009},
year = {2009},
pages = {169--178},
publisher = {ACM},
timestamp = {2015.10.05},
}
@InProceedings{GPV08,
author = {Gentry, C. and Peikert, C. and Vaikuntanathan, V.},
title = {Trapdoors for hard lattices and new cryptographic constructions},
booktitle = {{STOC} 2008},
year = {2008},
pages = {197--206},
publisher = {{ACM}},
timestamp = {2015.08.29},
}
@InProceedings{GMR85,
author = {Goldwasser, Shafi and Micali, Silvio and Rackoff, Charles},
title = {The knowledge complexity of interactive proof-systems},
booktitle = {{STOC} 1985},
year = {1985},
pages = {291--304},
organization = {ACM},
publisher = {{ACM}},
}
@InProceedings{GVW15,
author = {Gorbunov, S. and Vaikuntanathan, V. and Wee, H.},
title = {Predicate Encryption for Circuits from {LWE}},
booktitle = {{Crypto} 2015},
year = {2015},
number = {9216},
series = {LNCS},
pages = {503--523},
publisher = {Springer},
timestamp = {2012.10.16},
}
@InProceedings{GVW13,
author = {Gorbunov, S. and Vaikuntanathan, V. and Wee, H.},
title = {Attribute-based encryption for circuits},
booktitle = {{STOC} 2013},
year = {2013},
pages = {545--554},
publisher = {ACM},
timestamp = {2015.05.14},
}
@InProceedings{GKV10,
author = {Gordon, S Dov and Katz, Jonathan and Vaikuntanathan, Vinod},
title = {A group signature scheme from lattice assumptions},
booktitle = {{Asiacrypt} 2010},
year = {2010},
volume = {2647},
series = {LNCS},
pages = {395--412},
publisher = {Springer},
}
@InProceedings{GH08,
author = {Matthew Green and Susan Hohenberger},
title = {Universally Composable Adaptive Oblivious Transfer},
booktitle = {{Asiacrypt} 2008},
year = {2008},
number = {5350},
series = {LNCS},
pages = {179--197},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{Gro07,
author = {J. Groth},
title = {Fully Anonymous Group Signatures without Random Oracles},
booktitle = {{Asiacrypt} 2007},
year = {2007},
volume = {4833},
series = {LNCS},
pages = {164--180},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{GS08,
author = {J. Groth and A. Sahai},
title = {Efficient Non-interactive Proof Systems for Bilinear Groups},
booktitle = {{Eurocrypt} 2008},
year = {2008},
volume = {4965},
series = {LNCS},
pages = {415--432},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{HW09,
author = {Hohenberger, S. and Waters, B.},
title = {Short and Stateless Signatures from the {RSA} Assumption},
booktitle = {{Crypto}},
year = {2009},
volume = {5677},
series = {LNCS},
pages = {654--670},
publisher = {Springer},
timestamp = {2013.02.11},
}
@InProceedings{JKPT12,
author = {Jain, A. and Krenn, S. and Pietrzak, K. and Tentes, A.},
title = {Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise},
booktitle = {{Asiacrypt} 2012},
year = {2012},
volume = {7658},
series = {LNCS},
pages = {663--680},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.06},
}
@InProceedings{KTX08,
author = {Kawachi, A. and Tanaka, K. and Xagawa, K.},
title = {Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems},
booktitle = {{Asiacrypt} 2008},
year = {2008},
volume = {5350},
series = {LNCS},
pages = {372--389},
publisher = {Springer},
timestamp = {2015.09.26},
}
@InProceedings{KTY07,
author = {Aggelos Kiayias and Yiannis Tsiounis and Moti Yung},
title = {Group Encryption},
booktitle = {{Asiacrypt} 2007},
year = {2007},
number = {4833},
series = {LNCS},
pages = {181--199},
publisher = {Springer},
timestamp = {2015.10.06},
}
@Article{KY06,
author = {Kiayias, Aggelos and Yung, Moti},
title = {Secure scalable group signature with dynamic joins and separable authorities},
year = {2006},
volume = {1},
number = {1},
pages = {24--45},
journaltitle = {International Journal of Security and Networks},
publisher = {Inderscience},
}
@InProceedings{KY05,
author = {Kiayias, Aggelos and Yung, Moti},
title = {Group Signatures with Efficient Concurrent Join},
booktitle = {{Eurocrypt} 2005},
year = {2005},
number = {3494},
series = {LNCS},
pages = {198--214},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{LLLS13,
author = {Laguillaumie, Fabien and Langlois, Adeline and Libert, Beno{\^\i}t and Stehl{\'e}, Damien},
title = {Lattice-based group signatures with logarithmic signature size},
booktitle = {{Asiacrypt} 2013},
year = {2013},
volume = {8270},
series = {LNCS},
pages = {41--61},
publisher = {Springer},
}
@InProceedings{LLNW14,
author = {Langlois, Adeline and Ling, San and Nguyen, Khoa and Wang, Huaxiong},
title = {Lattice-based group signature scheme with verifier-local revocation},
booktitle = {{PKC} 2014},
year = {2014},
volume = {8383},
series = {LNCS},
pages = {345--361},
publisher = {Springer},
}
@InProceedings{LSS14,
author = {Langlois, Adeline and Stehl\'e, Damien and Steinfeld, Ron},
title = {{GGHLite}: More Efficient Multilinear Maps from Ideal Lattices},
booktitle = {{Eurocrypt} 2014},
year = {2014},
volume = {8441},
series = {LNCS},
pages = {239--256},
publisher = {Springer},
timestamp = {2015.08.29},
}
@InProceedings{LLNW16,
author = {Libert, B. and Ling, S. and Nguyen, K. and Wang, H.},
title = {Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-size Ring Signatures and Group Signatures Without Trapdoors},
booktitle = {{Eurocrypt} 2016},
year = {2016},
volume = {9666},
series = {LNCS},
pages = {1--31},
publisher = {Springer},
timestamp = {2016.02.01},
}
@InProceedings{LPY15,
author = {Beno\^{\i}t Libert and Thomas Peters and Moti Yung},
title = {Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions},
booktitle = {{Crypto} 2015},
year = {2015},
volume = {9216},
series = {LNCS},
pages = {296--316},
publisher = {Springer},
timestamp = {2015.10.06},
}
@InProceedings{LNSW13,
author = {Ling, San and Nguyen, Khoa and Stehl{\'e}, Damien and Wang, Huaxiong},
title = {Improved zero-knowledge proofs of knowledge for the {ISIS} problem, and applications},
booktitle = {{PKC} 2013},
year = {2013},
volume = {7778},
pages = {107--124},
publisher = {Springer},
}
@InProceedings{LAN02,
author = {Helger Lipmaa and N. Asokan and Valtteri Niemi},
title = {{Secure Vickrey Auctions without Threshold Trust}},
booktitle = {Financial Cryptography},
year = {2002},
volume = {2357},
series = {LNCS},
pages = {87--101},
publisher = {Springer},
timestamp = {2016.01.30},
}
@InProceedings{Lyu08,
author = {Vadim Lyubashevsky},
title = {Lattice-Based Identification Schemes Secure Under Active Attacks},
booktitle = {{PKC} 2008},
year = {2008},
volume = {4939},
series = {LNCS},
pages = {162--179},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.03},
}
@InProceedings{LPR10,
author = {V. Lyubashevsky and C. Peikert and O. Regev},
title = {On Ideal Lattices and Learning with Errors over Rings},
booktitle = {{Eurocrypt} 2010},
year = {2010},
volume = {6110},
series = {LNCS},
pages = {1--23},
publisher = {Springer},
owner = {Benoit},
timestamp = {2015.10.06},
}
@InProceedings{MP12,
author = {Micciancio, D. and Peikert, C.},
title = {Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller},
booktitle = {{Eurocrypt} 2012},
year = {2012},
volume = {7237},
series = {LNCS},
pages = {700--718},
publisher = {Springer},
timestamp = {2015.09.26},
}
@InProceedings{MV03,
author = {Micciancio, D. and Vadhan, S.},
title = {Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More},
booktitle = {{Crypto} 2003},
year = {2003},
volume = {2729},
series = {LNCS},
pages = {282--298},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.06},
}
@InProceedings{NZZ15,
author = {Nguyen, Phong Q and Zhang, Jiang and Zhang, Zhenfeng},
title = {Simpler Efficient Group Signatures from Lattices},
booktitle = {{PKC} 2015},
year = {2015},
volume = {9020},
series = {LNCS},
pages = {401--426},
publisher = {Springer},
}
@InProceedings{Pei09,
author = {Peikert, C.},
title = {Public-key cryptosystems from the worst-case shortest vector problem},
booktitle = {{STOC} 2009},
year = {2009},
pages = {333--342},
publisher = {ACM},
timestamp = {2015.09.26},
}
@InProceedings{PV08,
author = {Peikert, C. and Vaikuntanathan, V.},
title = {Non-interactive Statistical Zero-Knowledge Proofs for Lattice Problems},
booktitle = {{Crypto}},
year = {2008},
volume = {5157},
series = {LNCS},
pages = {536--553},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.06},
}
@InProceedings{Reg05,
author = {Regev, O.},
title = {On lattices, learning with errors, random linear codes, and cryptography},
booktitle = {{STOC} 2005},
year = {2005},
pages = {84--93},
publisher = {{ACM}},
timestamp = {2015.09.26},
}
@InProceedings{RST01,
author = {Rivest, Ronald L. and Shamir, Adi and Tauman, Yael},
title = {How to Leak a Secret},
booktitle = {{Asiacrypt} 2001},
year = {2001},
volume = {2248},
series = {LNCS},
pages = {552--565},
publisher = {Springer},
owner = {Benoit},
timestamp = {2015.10.03},
}
@Article{Ste96,
author = {Stern, Jacques},
title = {A new paradigm for public key identification},
year = {1996},
volume = {42},
number = {6},
pages = {1757--1768},
journaltitle = {IEEE Transactions on Information Theory},
publisher = {IEEE},
}
@InProceedings{XXW13,
author = {Xie, X. and Xue, R. and Wang, M.},
title = {Zero Knowledge Proofs from {Ring-LWE}},
booktitle = {{CANS} 2013},
year = {2013},
volume = {8257},
series = {LNCS},
pages = {57--73},
publisher = {Springer},
owner = {Benoit},
timestamp = {2016.02.06},
}
@Book{BSS05,
title = {Advances in elliptic curve cryptography},
publisher = {Cambridge University Press},
year = {2005},
author = {Blake, Ian F and Seroussi, Gadiel and Smart, Nigel P},
volume = {317},
}
@InProceedings{Che06,
author = {Jung Hee Cheon},
title = {Security Analysis of the Strong Diffie-Hellman Problem},
booktitle = {Eurocrypt},
year = {2006},
editor = {Springer},
volume = {4004},
series = {LNCS},
}
@Misc{NIS17,
author = {NIST},
title = {{NIST post-quantum competition. Round 1.}},
month = dec,
year = {2017},
note = {\url{https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-1-Submissions}},
}
@Misc{Wun10,
author = {Thomas Wunderer},
title = {Lattice Challenge},
year = {2010},
note = {\url{https://www.latticechallenge.org/index.php}},
}
@InProceedings{HK17,
author = {Herold, Gottfried and Kirshanova, Elena},
title = {Improved Algorithms for the Approximate k-List Problem in {E}uclidean Norm},
booktitle = {PKC'17},
year = {2017},
pages = {16--40},
publisher = {Springer},
abstract = {We present an algorithm for the approximate k-List problem for the Euclidean distance that improves upon the Bai-Laarhoven-Stehl{\'e} (BLS) algorithm from ANTS'16. The improvement stems from the observation that almost all the solutions to the approximate k-List problem form a particular configuration in n-dimensional space. Due to special properties of configurations, it is much easier to verify whether a k-tuple forms a configuration rather than checking whether it gives a solution to the k-List problem. Thus, phrasing the k-List problem as a problem of finding such configurations immediately gives a better algorithm. Furthermore, the search for configurations can be sped up using techniques from Locality-Sensitive Hashing (LSH). Stated in terms of configuration-search, our LSH-like algorithm offers a broader picture on previous LSH algorithms.},
isbn = {978-3-662-54365-8},
}
@InProceedings{ADRS15,
author = {Aggarwal, Divesh and Dadush, Daniel and Regev, Oded and Stephens-Davidowitz, Noah},
title = {Solving the Shortest Vector Problem in 2N Time Using Discrete Gaussian Sampling: Extended Abstract},
booktitle = {Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing},
year = {2015},
series = {STOC '15},
pages = {733--742},
address = {New York, NY, USA},
publisher = {ACM},
acmid = {2746606},
doi = {10.1145/2746539.2746606},
isbn = {978-1-4503-3536-2},
keywords = {discrete Gaussian, lattices, shortest vector problem},
location = {Portland, Oregon, USA},
numpages = {10},
url = {http://doi.acm.org/10.1145/2746539.2746606},
}
@InProceedings{Jou00,
author = {Joux, Antoine},
title = {A One Round Protocol for Tripartite Diffie--Hellman},
booktitle = {Algorithmic Number Theory},
year = {2000},
editor = {Bosma, Wieb},
pages = {385--393},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {In this paper, we propose a three participants variation of the Diffie-Hellman protocol. This variation is based on the Weil and Tate pairings on elliptic curves, which were first used in cryptography as cryptanalytic tools for reducing the discrete logarithm problem on some elliptic curves to the discrete logarithm problem in a finite field.},
isbn = {978-3-540-44994-2},
}
@InProceedings{BF01,
author = {Boneh, Dan and Franklin, Matt},
title = {Identity-Based Encryption from the Weil Pairing},
booktitle = {CRYPTO 2001},
year = {2001},
editor = {Kilian, Joe},
pages = {213--229},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Our system is based on the Weil pairing. We give precise definitions for secure identity based encryption schemes and give several applications for such systems.},
isbn = {978-3-540-44647-7},
}
@InProceedings{Wat05,
author = {Waters, Brent},
title = {Efficient Identity-Based Encryption Without Random Oracles},
booktitle = {Eurocrypt 2005},
year = {2005},
editor = {Cramer, Ronald},
pages = {114--127},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can be used to build a new signature scheme that is secure under the computational Diffie-Hellman assumption without random oracles.},
isbn = {978-3-540-32055-5},
}
@InProceedings{KSS08,
author = {Kachisa, Ezekiel J. and Schaefer, Edward F. and Scott, Michael},
title = {Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field},
booktitle = {Pairing-Based Cryptography -- Pairing 2008},
year = {2008},
editor = {Galbraith, Steven D. and Paterson, Kenneth G.},
pages = {126--135},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {We describe a new method for constructing Brezing-Weng-like pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new construction we present new ``record breaking'' families of pairing-friendly curves with embedding degrees of k{\thinspace}∈{\thinspace}{\{}16,18,36,40{\}}, and some interesting new constructions for the cases k{\thinspace}∈{\thinspace}{\{}8,32{\}}.},
isbn = {978-3-540-85538-5},
}
@InProceedings{BN06,
author = {Barreto, Paulo S. L. M. and Naehrig, Michael},
title = {Pairing-Friendly Elliptic Curves of Prime Order},
booktitle = {Selected Areas in Cryptography},
year = {2006},
editor = {Preneel, Bart and Tavares, Stafford},
pages = {319--331},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree {\$}k {\backslash}leqslant 6 {\$} . More general methods produce curves over {\$}{\{}{\backslash}mathbb F{\}}{\_}{\{}p{\}}{\$} where the bit length of p is often twice as large as that of the order r of the subgroup with embedding degree k; the best published results achieve $\rho$ ≡ log(p)/log(r) {\textasciitilde} 5/4. In this paper we make the first step towards surpassing these limitations by describing a method to construct elliptic curves of prime order and embedding degree k = 12. The new curves lead to very efficient implementation: non-pairing operations need no more than {\$}{\{}{\backslash}mathbb F{\}}{\_}{\{}p^4{\}}{\$} arithmetic, and pairing values can be compressed to one third of their length in a way compatible with point reduction techniques. We also discuss the role of large CM discriminants D to minimize $\rho$; in particular, for embedding degree k = 2q where q is prime we show that the ability to handle log(D)/log(r) {\textasciitilde} (q--3)/(q--1) enables building curves with $\rho$ {\textasciitilde} q/(q--1).},
isbn = {978-3-540-33109-4},
}
@Article{BD18,
author = {Barbulescu, Razvan and Duquesne, Sylvain},
title = {Updating Key Size Estimations for Pairings},
journal = {Journal of Cryptology},
year = {2018},
month = {Jan},
issn = {1432-1378},
abstract = {Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings and propose new key sizes using an analysis which is more precise than the analysis in a recent article of Menezes, Sarkar and Singh. We also select pairing-friendly curves for standard security levels.},
day = {29},
doi = {10.1007/s00145-018-9280-5},
url = {https://doi.org/10.1007/s00145-018-9280-5},
}
@InProceedings{KB16,
author = {Kim, Taechan and Barbulescu, Razvan},
title = {Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case},
booktitle = {CRYPTO 2016},
year = {2016},
editor = {Robshaw, Matthew and Katz, Jonathan},
pages = {543--571},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {We introduce a new variant of the number field sieve algorithm for discrete logarithms in {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}{\{}p^n{\}}{\$}{\$} called exTNFS. The most important modification is done in the polynomial selection step, which determines the cost of the whole algorithm: if one knows how to select good polynomials to tackle discrete logarithms in {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}{\{}p^{\backslash}kappa {\}}{\$}{\$} , exTNFS allows to use this method when tackling {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}{\{}p^{\{}{\backslash}eta {\backslash}kappa {\}}{\}}{\$}{\$} whenever {\$}{\$}{\backslash}gcd ({\backslash}eta ,{\backslash}kappa )=1{\$}{\$} . This simple fact has consequences on the asymptotic complexity of NFS in the medium prime case, where the complexity is reduced from {\$}{\$}L{\_}Q(1/3,{\backslash}root 3 {\backslash}of {\{}96/9{\}}){\$}{\$} to {\$}{\$}L{\_}Q(1/3,{\backslash}root 3 {\backslash}of {\{}48/9{\}}){\$}{\$} , {\$}{\$}Q=p^n{\$}{\$} , respectively from {\$}{\$}L{\_}Q(1/3,2.15){\$}{\$} to {\$}{\$}L{\_}Q(1/3,1.71){\$}{\$} if multiple number fields are used. On the practical side, exTNFS can be used when {\$}{\$}n=6{\$}{\$} and {\$}{\$}n=12{\$}{\$} and this requires to updating the keysizes used for the associated pairing-based cryptosystems.},
isbn = {978-3-662-53018-4},
}
@Misc{BGdMM05,
author = {Lucas Ballard and Matthew Green and Breno de Medeiros and Fabian Monrose},
title = {Correlation-Resistant Storage via Keyword-Searchable Encryption},
howpublished = {Cryptology ePrint Archive, Report 2005/417},
year = {2005},
note = {\url{https://eprint.iacr.org/2005/417}},
}
@Article{KL11,
author = {Kidron, Dafna and Lindell, Yehuda},
title = {Impossibility Results for Universal Composability in<69>Public-Key Models and with Fixed Inputs},
journal = {Journal of Cryptology},
year = {2011},
volume = {24},
number = {3},
pages = {517--544},
month = {Jul},
issn = {1432-1378},
abstract = {Universal composability and concurrent general composition consider a setting where secure protocols are run concurrently with each other and with arbitrary other possibly insecure protocols. Protocols that meet the definition of universal composability are guaranteed to remain secure even when run in this strongly adversarial setting. In the case of an honest majority, or where there is a trusted setup phase of some kind (like a common reference string or the key-registration public-key infrastructure of Barak et al.<2E>in FOCS 2004), it has been shown that any functionality can be securely computed in a universally composable way. On the negative side, it has also been shown that in the plain model where there is no trusted setup at all, there are large classes of functionalities which cannot be securely computed in a universally composable way without an honest majority.},
day = {01},
doi = {10.1007/s00145-010-9069-7},
url = {https://doi.org/10.1007/s00145-010-9069-7},
}
@InProceedings{CKL03,
author = {Canetti, Ran and Kushilevitz, Eyal and Lindell, Yehuda},
title = {On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions},
booktitle = {Eurocrypt 2003},
year = {2003},
editor = {Biham, Eli},
pages = {68--86},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {The recently proposed universally composable (UC) security framework, for analyzing security of cryptographic protocols, provides very strong security guarantees. In particular, a protocol proven secure in this framework is guaranteed to maintain its security even when deployed in arbitrary multi-party, multi-protocol, multi-execution environments.},
isbn = {978-3-540-39200-2},
}
@Article{CKL06,
author = {Canetti, Ran and Kushilevitz, Eyal and Lindell, Yehuda},
title = {On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions},
journal = {Journal of Cryptology},
year = {2006},
volume = {19},
number = {2},
pages = {135--167},
month = {Apr},
issn = {1432-1378},
abstract = {The recently proposed universally composable security framework for analyzing security of cryptographicprotocols provides very strong security guarantees. In particular,a protocol proven secure in this framework is guaranteed tomaintain its security even when run concurrently with arbitraryother protocols. It has been shown that if a majority of the parties arehonest, then universally composableprotocols exist for essentially any cryptographic taskin the plain model (i.e., with no set-up assumptions beyond that ofauthenticated communication).When honest majority is not guaranteed, general feasibility results areknown only when given a trusted set-up, such as in the common reference stringmodel. Only little was known regarding the existence ofuniversally composable protocols in the plain model withouthonest majority, and in particular regarding theimportant special case of two-party protocols. We study thefeasibility of universally composable two-party functionevaluation in the plain model. Our results show that in thissetting, very few functions can be securely computed in theframework of universal composability. We demonstrate this byproviding broad impossibility results that apply to large classesof deterministic and probabilistic functions. For some of theseclasses, we also present full characterizations of what can andcannot be securely realized in the framework of universalcomposability. Specifically, our characterizations are for theclasses of deterministic functions in which (a) both partiesreceive the same output, (b) only one party receives output, and(c) only one party has input.},
day = {01},
doi = {10.1007/s00145-005-0419-9},
url = {https://doi.org/10.1007/s00145-005-0419-9},
}
@InProceedings{Yao86,
author = {Yao, Andrew Chi-Chih},
title = {How to generate and exchange secrets},
booktitle = {FOCS},
year = {1986},
}
@InProceedings{LP07,
author = {Lindell, Yehuda and Pinkas, Benny},
title = {An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries},
booktitle = {Eurocrypt 2007},
year = {2007},
editor = {Naor, Moni},
pages = {52--78},
address = {Berlin, Heidelberg},
publisher = {Springer Berlin Heidelberg},
abstract = {We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secure in the presence of semi-honest adversaries. Security against malicious adversaries can be obtained by applying the compiler of Goldreich, Micali and Wigderson (the ``GMW compiler''). However, this approach does not seem to be very practical as it requires using generic zero-knowledge proofs.},
isbn = {978-3-540-72540-4},
}
@InProceedings{Coo71,
author = {Cook, Stephen A.},
title = {The Complexity of Theorem-proving Procedures},
booktitle = {Proceedings of the Third Annual ACM Symposium on Theory of Computing},
year = {1971},
series = {STOC '71},
pages = {151--158},
address = {New York, NY, USA},
publisher = {ACM},
acmid = {805047},
doi = {10.1145/800157.805047},
location = {Shaker Heights, Ohio, USA},
numpages = {8},
url = {http://doi.acm.org/10.1145/800157.805047},
}
@InProceedings{MSS17,
author = {Menezes, Alfred and Sarkar, Palash and Singh, Shashank},
title = {{Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography}},
booktitle = {Paradigms in Cryptology -- Mycrypt 2016. Malicious and Exploratory Cryptology},
year = {2017},
editor = {Phan, Rapha{\"e}l C.-W. and Yung, Moti},
pages = {83--108},
address = {Cham},
publisher = {Springer International Publishing},
abstract = {In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields {\$}{\$}{\{}{\backslash}mathbb F{\}}{\_}{\{}p^n{\}}{\$}{\$} where p is prime and {\$}{\$}n > 1{\$}{\$} is a small integer. This article presents a concise overview of these algorithms and discusses some of the challenges with assessing their impact on keylengths for pairing-based cryptosystems.},
isbn = {978-3-319-61273-7},
}
@Article{Gil77,
author = {John Gill},
title = {{Computational Complexity of Probabilistic Turing Machines}},
journal = {SIAM J. on Computing},
year = {1977},
volume = {6},
number = {4},
pages = {675-695},
doi = {10.1137/0206049},
eprint = {https://doi.org/10.1137/0206049},
url = {
https://doi.org/10.1137/0206049
},
}
@Misc{Rab60,
author = {Rabin, Michael Oser},
title = {Degree of difficulty of computing a function and a partial ordering of recursive sets},
howpublished = {Technical Report 2, {Hebrew University of Jerusalem}},
year = {1960},
publisher = {Hebrew University},
}
@Book{AB09,
title = {Computational Complexity: A Modern Approach},
publisher = {Cambridge University Press},
year = {2009},
author = {Arora, Sanjeev and Barak, Boaz},
address = {New York, NY, USA},
edition = {1st},
isbn = {0521424267, 9780521424264},
}
@Book{KL07,
title = {Introduction to Modern Cryptography (Chapman \& Hall/Crc Cryptography and Network Security Series)},
publisher = {Chapman \& Hall/CRC},
year = {2007},
author = {Katz, Jonathan and Lindell, Yehuda},
isbn = {1584885513},
}
@InProceedings{BR93,
author = {Bellare, Mihir and Rogaway, Phillip},
title = {Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols},
booktitle = {CCS},
year = {1993},
publisher = {ACM},
acmid = {168596},
doi = {10.1145/168588.168596},
isbn = {0-89791-629-8},
location = {Fairfax, Virginia, USA},
numpages = {12},
url = {http://doi.acm.org/10.1145/168588.168596},
}
@Article{CGH04,
author = {Canetti, Ran and Goldreich, Oded and Halevi, Shai},
title = {The Random Oracle Methodology, Revisited},
journal = {J. of ACM},
year = {2004},
volume = {51},
number = {4},
pages = {557--594},
month = jul,
issn = {0004-5411},
acmid = {1008734},
address = {New York, NY, USA},
doi = {10.1145/1008731.1008734},
issue_date = {July 2004},
keywords = {CS-proofs, Correlation intractability, cryptography, diagonalization, the random-oracle model},
numpages = {38},
publisher = {ACM},
url = {http://doi.acm.org/10.1145/1008731.1008734},
}
@InProceedings{LLM+17,
author = {Libert, Beno{\^i}t and Ling, San and Mouhartem, Fabrice and Nguyen, Khoa and Wang, Huaxiong},
title = {Adaptive Oblivious Transfer with Access Control from Lattice Assumptions},
booktitle = {Asiacrypt 2017},
year = {2017},
editor = {Takagi, Tsuyoshi and Peyrin, Thomas},
pages = {533--563},
address = {Cham},
publisher = {Springer International Publishing},
isbn = {978-3-319-70694-8},
}
@InProceedings{LMPY16,
author = {Libert, Beno\^{\i}t and Mouhartem, Fabrice and Peters, Thomas and Yung, Moti},
title = {Practical "Signatures with Efficient Protocols" from Simple Assumptions},
booktitle = {AsiaCCS},
year = {2016},
pages = {511--522},
publisher = {ACM},
acmid = {2897898},
doi = {10.1145/2897845.2897898},
isbn = {978-1-4503-4233-9},
keywords = {anonymous credentials, efficient privacy-enhancing protocols, group signatures, privacy, signature, signature with efficient protocols, simple cryptographic assumptions},
location = {Xi'an, China},
numpages = {12},
url = {http://doi.acm.org/10.1145/2897845.2897898},
}
@Article{GM84,
author = {Shafi Goldwasser and Silvio Micali},
title = {Probabilistic encryption},
journal = {J. of Computer and System Sciences},
year = {1984},
volume = {28},
number = {2},
pages = {270 - 299},
issn = {0022-0000},
doi = {https://doi.org/10.1016/0022-0000(84)90070-9},
url = {http://www.sciencedirect.com/science/article/pii/0022000084900709},
}
@Comment{jabref-meta: databaseType:bibtex;}
Reference in New Issue View Git Blame Copy Permalink