{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:50:54Z","timestamp":1750859454265},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_30","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"350-361","source":"Crossref","is-referenced-by-count":3,"title":["Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shachar","family":"Lovett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ic.2007.02.006","volume":"205","author":"N. Ailon","year":"2007","unstructured":"Ailon, N., Alon, N.: Hardness of fully dense problems. Inform. and Comput.\u00a0205(8), 1117\u20131129 (2007)","journal-title":"Inform. and Comput."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/1250790.1250863","volume-title":"STOC 2007","author":"N. Alon","year":"2007","unstructured":"Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R., Xie, N.: Testing k-wise and almost k-wise independence. In: STOC 2007, pp. 496\u2013505. ACM, New York (2007)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized algorithm for the maximal independent set problem. Journal of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"Journal of Algorithms"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(03)00359-4","volume":"88","author":"N. Alon","year":"2003","unstructured":"Alon, N., Goldreich, O., Mansour, Y.: Almost k-wise independence versus k-wise independence. Inf. Process. Lett.\u00a088, 107\u2013110 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/100783534","volume":"40","author":"P. Austrin","year":"2011","unstructured":"Austrin, P., H\u00e5stad, J.: Randomly supported independence and resistance. SIAM J. Comput.\u00a040(1), 1\u201327 (2011)","journal-title":"SIAM J. Comput."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Alon, N., Lovett, S.: Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. Electronic Colloquium on Computational Complexity, ECCC (2011)","DOI":"10.1007\/978-3-642-32512-0_30"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Alagic, G., Russell, A.: Spectral Concentration of Positive Functions on Compact Groups. Journal of Fourier Analysis and Applications, 1\u201319 (February 2011)","DOI":"10.1007\/s00041-011-9174-5"},{"key":"30_CR8","first-page":"611","volume-title":"Handbook of Combinatorics","author":"P.J. Cameron","year":"1995","unstructured":"Cameron, P.J.: Permutation groups. In: Handbook of Combinatorics, vol.\u00a01, 2, pp. 611\u2013645. Elsevier, Amsterdam (1995)"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00222-007-0065-y","volume":"170","author":"M. Kassabov","year":"2007","unstructured":"Kassabov, M.: Symmetric groups and expanders. Inventiones Mathematicae\u00a0170(2), 327\u2013354 (2007)","journal-title":"Inventiones Mathematicae"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1145\/2213977.2214075","volume-title":"Proceedings of the 44th Symposium on Theory of Computing, STOC 2012","author":"G. Kuperberg","year":"2012","unstructured":"Kuperberg, G., Lovett, S., Peled, R.: Probabilistic existence of rigid combinatorial structures. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 1091\u20131106. ACM, New York (2012)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1137\/S0895480192228140","volume":"7","author":"D. Koller","year":"1994","unstructured":"Koller, D., Megiddo, N.: Constructing small sample spaces satisfying given constraints. SIAM Journal on Discrete Mathematics\u00a07, 260\u2013274 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11538462_30","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Kaplan","year":"2005","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized Constructions of k-Wise (Almost) Independent Permutations. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX and RANDOM 2005. LNCS, vol.\u00a03624, pp. 354\u2013365. Springer, Heidelberg (2005)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02511813","volume":"7","author":"K. Kueh","year":"2001","unstructured":"Kueh, K., Olson, T., Rockmore, D., Tan, K.: Nonlinear approximation theory on compact groups. Journal of Fourier Analysis and Applications\u00a07, 257\u2013281 (2001)","journal-title":"Journal of Fourier Analysis and Applications"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1137\/0211053","volume":"11","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing\u00a011(4), 620\u2013632 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02475926","volume":"4","author":"D. Maslen","year":"1998","unstructured":"Maslen, D.: Efficient computation of fourier transforms on compact groups. Journal of Fourier Analysis and Applications\u00a04, 19\u201352 (1998)","journal-title":"Journal of Fourier Analysis and Applications"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10623-009-9290-2","volume":"53","author":"A. Roy","year":"2009","unstructured":"Roy, A., Scott, A.J.: Unitary designs and codes. Des. Codes Cryptography\u00a053, 13\u201331 (2009)","journal-title":"Des. Codes Cryptography"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TIT.2005.864438","volume":"52","author":"A. Russell","year":"2006","unstructured":"Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. IEEE Transactions on Information Theory\u00a052(3), 1130\u20131140 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-642-14165-2_48","volume-title":"Automata, Languages and Programming","author":"R. Rubinfeld","year":"2010","unstructured":"Rubinfeld, R., Xie, N.: Testing Non-uniform k-Wise Independent Distributions over Product Spaces. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 565\u2013581. Springer, Heidelberg (2010)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 98","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable Security for Block Ciphers by Decorrelation. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46513-8_4","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"2000","unstructured":"Vaudenay, S.: Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 49\u201361. Springer, Heidelberg (2000)"},{"issue":"4","key":"30_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S. Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: a theory for block cipher security. Journal of Cryptology\u00a016(4), 249\u2013286 (2003)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:02Z","timestamp":1606187402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}