Algebraic (Trapdoor) One-Way Functions and Their Applications

作者: Dario Catalano , Dario Fiore , Rosario Gennaro , Konstantinos Vamvourellis

DOI: 10.1007/978-3-642-36594-2_38

关键词: MathematicsVariety (universal algebra)Trapdoor functionGroup (mathematics)Algebraic cycleRing (mathematics)One-way functionFunction field of an algebraic varietyDiscrete mathematicsCombinatoricsAlgebraic number

摘要: In this paper we introduce the notion of Algebraic (Trapdoor) One Way Functions, which, roughly speaking, captures and formalizes many properties number-theoretic one-way functions. Informally, a (trapdoor) one way function F: X#8594;Y is said to be algebraic if X Y are (finite) abelian cyclic groups, homomorphic i.e. F(x)·F(y)=F(x ·y), ring-homomorphic, meaning that it possible compute linear operations 'in exponent' over some ring (which may different from ℤp where p order underlying group X) without knowing bases. Moreover, OWFs must flexibly in sense given y=F(x), infeasible (x′, d) such F(x′)=yd (for d≠0). Interestingly, functions can constructed variety standard number theoretic assumptions, as RSA, Factoring CDH bilinear groups. As second contribution paper, show several applications turn out useful. These include publicly verifiable secure outsourcing polynomials, linearly signatures batch execution Sigma protocols.

参考文章(41)
Fabian Monrose, Aviel D. Rubin, Peter Wyckoff, Distributed Execution with Remote Audit. network and distributed system security symposium. ,(1999)
Allison Lewko, Brent Waters, New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques international cryptology conference. ,vol. 2012, pp. 180- 198 ,(2012) , 10.1007/978-3-642-32009-5_12
Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan, How to delegate and verify in public: verifiable computation from attribute-based encryption theory of cryptography conference. pp. 422- 439 ,(2012) , 10.1007/978-3-642-28914-9_24
Charalampos Papamanthou, Elaine Shi, Roberto Tamassia, Signatures of Correct Computation Theory of Cryptography. pp. 222- 242 ,(2013) , 10.1007/978-3-642-36594-2_13
Bennet S. Yee, Using Secure Coprocessors ,(1994)
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert, Bonsai trees, or how to delegate a lattice basis theory and application of cryptographic techniques. pp. 523- 552 ,(2010) , 10.1007/978-3-642-13190-5_27
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, From Secrecy to Soundness: Efficient Verification via Secure Computation Automata, Languages and Programming. pp. 152- 163 ,(2010) , 10.1007/978-3-642-14165-2_14
Rosario Gennaro, Craig Gentry, Bryan Parno, Non-interactive verifiable computing: outsourcing computation to untrusted workers international cryptology conference. ,vol. 2009, pp. 465- 482 ,(2010) , 10.1007/978-3-642-14623-7_25
Dario Catalano, Dario Fiore, Bogdan Warinschi, Efficient network coding signatures in the standard model public key cryptography. pp. 680- 696 ,(2012) , 10.1007/978-3-642-30057-8_40