Since their first introduction as a cryptanalytic tool, bilinear pairings have moved to a very useful building block for cryptography. Current real-world applications of pairings include remote attestation, privacy-preserving blockchains and identity-based encryption. However, recent advances in the discrete log computation have reduced the efficiency of the main pairing constructions and previous candidates for standardization. This talk examines new sets of parameters for bilinear groups, to adjust security against these recent attacks, and discusses techniques for their efficient implementation in software.